2,241 Hits in 9.1 sec

A survey of algebraic properties used in cryptographic protocols

Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade
2006 Journal of Computer Security  
We give a list of some relevant algebraic properties of cryptographic operators, and for each of them, we provide examples of protocols or attacks using these properties.  ...  Such an assumption is too strong in general since some attacks exploit in a clever way the interaction between protocol rules and properties of cryptographic operators.  ...  Acknowledgments The authors would like to thank anonymous referees for their very helpful comments and Ralf Treinen to have read a preliminary version of this survey.  ... 
doi:10.3233/jcs-2006-14101 fatcat:offe7jsai5e5rl7jswiccgsyiq

Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties [chapter]

Pascal Lafourcade, Vanessa Terrade, Sylvain Vigier
2010 Lecture Notes in Computer Science  
In this article we compare time efficiency of these tools verifying some protocols of the litterature that are designed with such algebraic properties.  ...  Recently Kuesters et al proposed two new methods using ProVerif for analyzing cryptographic protocols with Exclusive-Or and Diffie-Hellman properties.  ...  In order to verify cryptographic protocols using such properties we use CL-Atse and OFMC two tools of the platform Avispa.  ... 
doi:10.1007/978-3-642-12459-4_13 fatcat:ulidyay2s5eh5apszidytikboi

Formal verification of cryptographic protocols: A survey [chapter]

Catherine A. Meadows, Catherine A. Meadows
1995 Lecture Notes in Computer Science  
In this paper we give a survey of the state of the art in the application of formal methods to the analysis of cryptographic protocols.  ...  We attempt to outline some of the major threads of research in this area, and also to document some emerging trends. : : :  ...  In this paper we give a survey of the state of the art in the application of formal methods to the analysis of cryptographic protocols.  ... 
doi:10.1007/bfb0000430 fatcat:iv53qcjzcjddhcujio6wwlukba

Performance Evaluations of Cryptographic Protocols Verification Tools Dealing with Algebraic Properties [chapter]

Pascal Lafourcade, Maxime Puys
2016 Lecture Notes in Computer Science  
There exist several automatic verification tools of cryptographic protocols, but only few of them are able to check protocols in presence of algebraic properties.  ...  Our aim is to compare their performances by analysing a selection of cryptographic protocols using XOR and DH.  ...  This research was conducted with the support of the "Digital trust" Chair from the University of Auvergne Foundation.  ... 
doi:10.1007/978-3-319-30303-1_9 fatcat:525nfmg5fbezjnkrhmhsofirue


Amol H. Shinde, Umbarkar A.J., Pillai N.R.
2017 ICTACT Journal on Communication Technology  
In this paper, we discuss the brief history of formal methods and tools that are useful for the formal verification of the cryptographic protocols.  ...  Cryptographic protocols cannot guarantee the secure operations by merely using state-of-the-art cryptographic mechanisms. Validation of such protocols is done by using formal methods.  ...  Dolev and Yao developed a formal model with an environment in which multiple protocol instances can be running concurrently and in which the cryptographic algorithms obey some set of algebraic properties  ... 
doi:10.21917/ijct.2017.0226 fatcat:cjtshuv25rbvjggalyzy7xtdkq

Formal Methods and Cryptography [chapter]

Michael Backes, Birgit Pfitzmann, Michael Waidner
2006 Lecture Notes in Computer Science  
Hence it is not obvious how one can treat cryptographic subsystems in a sound way within formal methods, in particular if one does not want to encumber the proof of an overall system by probabilities and  ...  We show the relation of RSIM and other types of specifications, and clarify what role the classical Dolev-Yao (term algebra) abstractions from cryptography can play in the future.  ...  In the context of larger systems, we see Dolev-Yao models as a tool on a middle level, useful for proving protocols that use standard cryptography in a blackbox way, but still rather explicitly.  ... 
doi:10.1007/11813040_44 fatcat:c7knpqnaiff6nf34qevqhkgbfq

A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems

Véronique Cortier, Steve Kremer, Bogdan Warinschi
2010 Journal of automated reasoning  
The other approach relies on a symbolic model of protocol executions in which cryptographic primitives are treated as black boxes.  ...  In this paper we survey existing results along both of these directions.  ...  It is worth emphasizing that the term algebra used in this setting is richer than the algebra typically used in automatic tools for security protocols.  ... 
doi:10.1007/s10817-010-9187-9 fatcat:6qrlhc34mnbnpmap2mkkrnfqhm

Limits of the Cryptographic Realization of Dolev-Yao-Style XOR [chapter]

Michael Backes, Birgit Pfitzmann
2005 Lecture Notes in Computer Science  
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols.  ...  The strongest results show this in the sense of reactive simulatability/UC, a notion that essentially means the preservation of arbitrary security properties under arbitrary active attacks and in arbitrary  ...  Reactive Simulatability We start by surveying the notion of reactive simulatability/UC that we use for comparing a Dolev-Yao model and a cryptographic realization with respect to security.  ... 
doi:10.1007/11555827_11 fatcat:bcbgl23sofevle5yvoq6btgzy4

Specification Of Agent Explicit Knowledge In Cryptographic Protocols

Khair Eddin Sabri, Ridha Khedri, Jason Jaskolka
2008 Zenodo  
In this paper, we propose a mathematical framework which specifies the explicit knowledge of an agent involved in a cryptographic protocol.  ...  Cryptographic protocols are widely used in various applications to provide secure communications. They are usually represented as communicating agents that send and receive messages.  ...  In CSP [16] and NRL analyzer [19] , the algebraic properties of cryptographic primitives are taken into consideration in producing new information.  ... 
doi:10.5281/zenodo.1329127 fatcat:w5pgsvvndrfafjqmbn6s4ax7hm

Electronic Voting: How Logic Can Help [chapter]

Véronique Cortier
2014 Lecture Notes in Computer Science  
In order to achieve this, electronic voting protocols make use of cryptographic primitives, as in the more traditional case of authentication or key exchange protocols.  ...  Indeed, they involve for example new and sophisticated cryptographic primitives, new dedicated security properties, and new execution structures.  ...  In cryptography, more accurate models are used: instead of using process algebra with terms, protocols and attackers are simply any (polynomial) Turing machines.  ... 
doi:10.1007/978-3-319-08587-6_2 fatcat:nhfqfkkrazbdna5n7g4qi6jhyq

Formal verification of security protocol implementations: a survey

Matteo Avalle, Alfredo Pironti, Riccardo Sisto
2012 Formal Aspects of Computing  
in programming languages.  ...  Automated formal verification of security protocols has been mostly focused on analyzing highlevel abstract models which, however, are significantly different from real protocol implementations written  ...  The ideal properties of real cryptographic functions are captured by the algebraic properties of the symbolic operations.  ... 
doi:10.1007/s00165-012-0269-9 fatcat:z7bgh5nnuzh4leo7wgf5rwd5ci

An Algebraic Approach for Reasoning About Information Flow [chapter]

Arthur Américo, Mário S. Alvim, Annabelle McIver
2018 Lecture Notes in Computer Science  
We demonstrate our results on the specification and analysis of the Crowds Protocol. Finally, we use the algebra to justify a new algorithm to compute leakage bounds for this protocol.  ...  We show how the algebra can be used to simplify large system specifications in order to facilitate the computation of information leakage bounds.  ...  Algebraic properties of channel operators In this section we prove a series of relevant algebraic properties of our channel operators.  ... 
doi:10.1007/978-3-319-95582-7_4 fatcat:rt343pmkfjc6dllrmxth5ss3xe

On the Design of Cryptographic Primitives

Pino Caballero-Gil, Amparo Fúster-Sabater
2006 Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications  
In order to achieve such a double goal, a tour through the descriptions of the two main cryptographic primitives is carried out.  ...  The main objective of this work is twofold. On the one hand, it gives a brief overview of the area of two-party cryptographic protocols.  ...  Afterwards, specific notation used throughout the work and general properties of two-party cryptographic protocols are described in section 3.  ... 
doi:10.1007/s10440-006-9044-3 fatcat:kg6sa2ci7bd2llxny5nfsnfqq4

A Review of Lightweight Cryptographic Schemes and Fundamental Cryptographic Characteristics of Boolean Functions

Nahla Fatahelrahman Ibrahim, Johnson Ihyeh Agbinya
2022 Advances in Internet of Things  
In this paper, we survey a number of studies in the literature on improving lightweight systems in the Internet of Things (IoT).  ...  The paper illustrates recent development of Boolean cryptographic function Application and how it assists in using hardware such as the internet of things.  ...  Johnson Ihyeh Agbinya for his contributions for many useful comments and his encouraging this work.  ... 
doi:10.4236/ait.2022.121002 fatcat:6kt4ftgf35auhhi2j4sgmcwtpy

Page 5268 of Mathematical Reviews Vol. , Issue 2000g [page]

2000 Mathematical Reviews  
Bit commitment is a primitive that is much used in cryptographic protocol design. One party, Alice, knows some information—a yes/no decision, say.  ...  The paper is a survey of this last development. The paper also discusses the implications of this for other related cryptographic protocols. Simon R.  ... 
« Previous Showing results 1 — 15 out of 2,241 results