The faithfulness of abstract protocol analysis: message authentication

hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studying cryptographic prohich abstracts from possible problems with the cryptography so as to focus on the structural aspects of the protocol. Recent work in this framework has developed easily applicable methods to determine many security properties of protocols. A separate line of work, initiated by Bellare and Rogaway, analyzes the way specific cryptographic primitives are used in protocols. It gives asymptotic bounds on the risk of failures of secrecy or authentication. In this paper we show how the Dolev-Yao model may be used for protocol analysis, while a further analysis gives a quantitative bound on the extent to which real cryptographic primitives may diverge from the idealized model. We develop this method where the cryptographic primitives are based on Carter-Wegman universal classes of hash functions....

• Type: Conference
• Year: 2001
• Where: CCS
• Authors: Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuck
• Keywords: Asymptotic Bounds, CCS 2001, Cryptographic Primitives, Security Privacy, Specific Cryptographic Primitives