A Survey of Algebraic Properties Used in Cryptographic Protocols

Véronique Cortier 1 Stéphanie Delaune 2 Pascal Lafourcade 2
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches usually consider the encryption schemes as black boxes and assume that an adversary cannot learn anything from an encrypted message except if he has the key. 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. Moreover, the executability of some protocols relies explicitly on some algebraic properties of cryptographic primitives such as commutative encryption. 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. We also give an overview of the existing methods in formal approaches for analyzing cryptographic protocols.
Document type :
Journal articles
Complete list of metadatas

Cited literature [103 references]  Display  Hide  Download

https://hal.inria.fr/inria-00000552
Contributor : Véronique Cortier <>
Submitted on : Thursday, December 14, 2017 - 4:43:59 PM
Last modification on : Thursday, February 7, 2019 - 2:28:13 PM

File

surveyCDL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00000552, version 1

Citation

Véronique Cortier, Stéphanie Delaune, Pascal Lafourcade. A Survey of Algebraic Properties Used in Cryptographic Protocols. Journal of Computer Security, IOS Press, 2006, 14 (1), pp.1-43. ⟨inria-00000552⟩

Share

Metrics

Record views

313

Files downloads

202