Filters








6,594 Hits in 3.4 sec

Automated Analysis of Cryptographic Assumptions in Generic Group Models [chapter]

Gilles Barthe, Edvard Fagerholm, Dario Fiore, John Mitchell, Andre Scedrov, Benedikt Schmidt
2014 Lecture Notes in Computer Science  
We initiate the study of principled, automated, methods for analyzing hardness assumptions in generic group models, following the approach of symbolic cryptography.  ...  Then, we develop and implement automated procedures for verifying the conditions of master theorems, and thus the validity of hardness assumptions in generic group models.  ...  Additional support for Mitchell, Scedrov, and Fagerholm is from the AFOSR MURI "Science of Cyber Security: Modeling, Composition, and Measurement" and from NSF Grants CNS-0831199 (Mitchell) and CNS-0830949  ... 
doi:10.1007/978-3-662-44371-2_6 fatcat:5bynt5ukubgt3ew2l5hgujh3mq

Tools for Secure Systems Development with UML: Security Analysis with ATPs [chapter]

Jan Jürjens, Pasha Shabalin
2005 Lecture Notes in Computer Science  
We focus on a verification routine that automatically verifies sequence diagrams with cryptographic algorithms for security requirements by using automated theorem provers. http://www4.in.tum.de/˜juerjens  ...  Advanced users of the UMLsec approach can use this open-source framework to implement verification routines for the constraints of self-defined stereotypes.  ...  Dynamic checkers translate the relevant fragments of the UML model into the input language of several analysis engines (such as model-checkers and automated theorem provers).  ... 
doi:10.1007/978-3-540-31984-9_23 fatcat:iuiqbz44ajdgzkh4mxr7x4qa5q

Using SMT solvers to automate design tasks for encryption and signature schemes

Joseph A. Akinyele, Matthew Green, Susan Hohenberger
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
AutoGroup converts a pairingbased encryption or signature scheme written in (simple) symmetric group notation into a specific instantiation in the more efficient, asymmetric setting.  ...  The main technical challenge here is to automate the "partitioned" check, which allows a highly-efficient transformation. complexity of the automation tasks by harnessing the power of SMT solvers.  ...  Their goal was automating the construction and verification of (game-based) cryptographic proofs. Our goal is automating the construction of cryptographic schemes.  ... 
doi:10.1145/2508859.2516718 dblp:conf/ccs/Akinyele0H13 fatcat:v7ue3uqqdzeize57yy5di3iojm

Automated Cryptographic Analysis of the Pedersen Commitment Scheme [chapter]

Roberto Metere, Changyu Dong
2017 Lecture Notes in Computer Science  
Aiming for strong security assurance, recently there has been an increasing interest in formal verification of cryptographic constructions.  ...  To formally verify the protocol, we extended the theory of EasyCrypt, a framework which allows for reasoning in the computational model, to support the discrete logarithm and an abstraction of commitment  ...  The tool gga ∞ [4] specialises in reasoning in the generic group model and seems promising when attackers have access to random oracles, which does not apply to our setting.  ... 
doi:10.1007/978-3-319-65127-9_22 fatcat:lc2ro2rlzvd4jfmek2hdnu5grq

Computer-Aided Cryptographic Proofs [chapter]

Gilles Barthe, Juan Manuel Crespo, Benjamin Grégoire, César Kunz, Santiago Zanella Béguelin
2012 Lecture Notes in Computer Science  
EasyCrypt is an automated tool that supports the machinechecked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of publickey  ...  The purpose of this paper is to motivate the role of computer-aided proofs in the broader context of provable security and to illustrate the workings of EasyCrypt through simple introductory examples.  ...  Experiments corresponding to security assumptions used to realize cryptographic goals: Decision Diffie-Hellman problem for a finite cyclic multiplicative group G with generator g (left) and One-Wayness  ... 
doi:10.1007/978-3-642-32347-8_2 fatcat:kxt2kyff2nea3dfdze2blbreay

Computer-Aided Cryptographic Proofs [chapter]

Gilles Barthe, Benjamin Grégoire, Santiago Zanella Béguelin
2012 Lecture Notes in Computer Science  
EasyCrypt is an automated tool that supports the machinechecked construction and verification of security proofs of cryptographic systems, and that has been used to verify emblematic examples of publickey  ...  The purpose of this paper is to motivate the role of computer-aided proofs in the broader context of provable security and to illustrate the workings of EasyCrypt through simple introductory examples.  ...  Experiments corresponding to security assumptions used to realize cryptographic goals: Decision Diffie-Hellman problem for a finite cyclic multiplicative group G with generator g (left) and One-Wayness  ... 
doi:10.1007/978-3-642-33125-1_1 fatcat:ync6ijz7pzdzleutqaxytfkyje

Finite-state analysis of security protocols [chapter]

John C. Mitchell
1998 Lecture Notes in Computer Science  
These include specialized logics that formalize notions such as secrecy and belief, special-purpose automated tools for cryptographic protocol analysis, and methods that apply general theoremproving or  ...  model-checking tools to security protocols.  ...  Martin Abadi, David Dill, Cynthia Dwork, Stephen Freund, Li Gong, Mark Mitchell, John Rushby, Ulrich Stern, Vitaly Shmatikov and many others for helping me learn about security and for their efforts in  ... 
doi:10.1007/bfb0028734 fatcat:qgnnel4nwrgtxkugvuga3ljnn4

miTLS: Verifying Protocol Implementations against Real-World Attacks

Karthikeyan Bhargavan, Cedric Fournet, Markulf Kohlweiss
2016 IEEE Security and Privacy  
Some semi-automated tools, such as CryptoVerif, can analyze protocols in a more precise computational model of cryptography, but similarly do not scale up to large models.  ...  Even verified implementations have to rely on cryptographic assumptions, the accuracy of the security model, and the correctness of proofs and verification tools.  ... 
doi:10.1109/msp.2016.123 fatcat:fisjry37bzexpdcl26l67e67p4

Fully automated analysis of padding-based encryption in the computational model

Gilles Barthe, Juan Manuel Crespo, Benjamin Grégoire, César Kunz, Yassine Lakhnech, Benedikt Schmidt, Santiago Zanella-Béguelin
2013 Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13  
Computer-aided verification provides effective means of analyzing the security of cryptographic primitives.  ...  model, and a toolset that bundles together fully automated proof search and attack finding algorithms.  ...  This model enables automated analysis, but can miss attacks that are possible in the computational model.  ... 
doi:10.1145/2508859.2516663 dblp:conf/ccs/BartheCGKLSB13 fatcat:r5esat4qcbda3lt4izque4mshi

Deep Learning Based Cryptographic Primitive Classification [article]

Gregory D. Hill, Xavier J. A. Bellekens
2017 arXiv   pre-print
To rival the size and variability of contemporary data compendiums, hence feeding the model cognition, a methodology for the procedural generation of synthetic cryptographic binaries is defined, utilising  ...  The following manuscript presents a novel approach for the classification of cryptographic primitives in compiled binary executables using deep learning.  ...  To effectively model cryptographic execution, previous research has relied on a number of assumptions and observations.  ... 
arXiv:1709.08385v1 fatcat:pze2f23objeybjwk53fih4c6wi

Automated Verification for Secure Messaging Protocols and Their Implementations: A Symbolic and Computational Approach

Nadim Kobeissi, Karthikeyan Bhargavan, Bruno Blanchet
2017 2017 IEEE European Symposium on Security and Privacy (EuroS&P)  
The model can also be used as the basis of a computational proof using CryptoVerif, which reduces the security of the protocol to standard cryptographic assumptions.  ...  This model can then be analyzed symbolically using ProVerif to find attacks in a variety of threat models.  ...  Cryptographic Models Traditionally, symbolic cryptographic models have been particularly suitable for automated protocol analysis.  ... 
doi:10.1109/eurosp.2017.38 dblp:conf/eurosp/KobeissiBB17 fatcat:jc3mdwujmzd2rhtzd3262sn2ca

Formal Methods in Information Security

AJAYI ADEBOWALE, NICULAE GOGA, OTUSILE OLUWABUKOLA, ABEL SAMUEL
2015 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY  
Formal methods use mathematical models for analysis and verification at any part of the programlife-cycle.  ...  paper describes the state of the art in the industrial use of formal methods ininformation security with a focus on verification of security protocols.  ...  Automating Formal Protocol Analysis When done by hand, formal analysis of security protocol models can be an error prone task, as often the security proofs require a large number of steps that are difficult  ... 
doi:10.24297/ijct.v14i4.1963 fatcat:s7ratzapovh6jgax26zbpsct2e

Automating Fast and Secure Translations from Type-I to Type-III Pairing Schemes

Joseph A. Akinyele, Christina Garman, Susan Hohenberger
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
assumptions can be weaker; however, Type-III called "asymmetric" is typically the most efficient choice for an implementation in terms of bandwidth and computation time.  ...  Our contribution is the design, development and evaluation of a new software tool, Auto-Group+, that automatically translates from Type-I to Type-III pairings.  ...  was secure in the generic group model.  ... 
doi:10.1145/2810103.2813601 dblp:conf/ccs/AkinyeleGH15 fatcat:3gzylcjgerej7ixtp7tuberg6y

Automated Logic-Based Technique for Formal Verification of Security Protocols

Anca D. Jurcut
2018 Journal of Advances in Computer Networks  
An empirical study is presented that assesses the effectiveness and efficiency of the proposed automated technique by applying it to a set of protocols, incorporating some with known vulnerabilities and  ...  The massive growth in communications, in particular in the wireless sector and internet of things, causes an ever changing environment for today"s communication services.  ...  (A2) ( , ) Rx   As none of the components in the cryptographic expression transmitted in response step S2 are timestamps or freshly generated by the recipient A, application of axiom (A2) yields: As  ... 
doi:10.18178/jacn.2018.6.2.258 fatcat:jqd45l67yndojhru5tjhjafciy

Formal methods for cryptographic protocol analysis: emerging issues and trends

C. Meadows
2003 IEEE Journal on Selected Areas in Communications  
The history of the application of formal methods to cryptographic protocol analysis spans over twenty years, and recently has been showing signs of new maturity and consolidation.  ...  Not only have a number of specialized tools been developed, and general-purpose ones been adapted, but people have begun applying these tools to realistic protocols, in many cases supplying feedback to  ...  Recently, we have also seen advances in the use of other types of tools besides model checkers in the analysis of cryptographic protocols.  ... 
doi:10.1109/jsac.2002.806125 fatcat:tayyhsybp5d6hhlv5glx4ehe7e
« Previous Showing results 1 — 15 out of 6,594 results