The Diffie-Hellman key-agreement scheme in the strand-space model

Proceedings of the Computer Security Foundations Workshop

Volumn 2003-January, Issue , 2003, Pages 234-247

  Herzog, J C ^a  

^a MITRE CORPORATION   (United States)

Author keywords

Algorithm design and analysis; Character generation; Complexity theory; Computational modeling; Cryptographic protocols; DC generators; National security; Public key; Public key cryptography; Terminology

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; DC GENERATORS; FORMAL METHODS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; SECURITY SYSTEMS; TERMINOLOGY;

ALGORITHM DESIGN AND ANALYSIS; CHARACTER GENERATION; COMPLEXITY THEORY; COMPUTATIONAL MODEL; CRYPTOGRAPHIC PROTOCOLS; PUBLIC KEYS;

NATIONAL SECURITY;

EID: 12144271120     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2003.1212716     Document Type: Conference Paper

References (13)

1. Martín Abadi and Jan Jürjens. Formal eavesdropping and its computational interpretation. Lecture Notes in Computer Science, 2215:82ff., 2001.
2. Martín Abadi and Phillip Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
3. Michael Backes, Birgit Pfitzmann, and Michael Waidner. A universally composable cryptographic library. Available at http://eprint.iacr.org/2003/015/, January 2003.
4. Dan Boneh. The decision Diffie-Hellman problem. In Proceedings of the Third Algorithmic Number Theory Symposium, number 1423 in Lecture Notes in Computer Science, pages 48-63. Springer-Verlag, 1998.
5. T. Dierks and C. Allen. The TLS protocol. RFC 2246, January 1999.
6. Daniel Dolev and Andrew Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 29:198-208, 1983.
7. Shafi Goldwasser and Mihir Bellare. Lecture notes on cryptography. Avaliable at http://www.cs.ucsd.edu/users/mihir/papers/gb.html, August 1999.
8. Joshua D. Guttman, F. Javier Thayer, and Lenore D. Zuck. The faithfulness of abstract protocol analysis: Message authentication. Journal of Computer Security, 2003. Forthcoming.
9. Jonathan Herzog. Computational soundness of formal adversaries. Master's thesis, Massachusetts Institute of Technology, 2002.
10. Olivier Pereira and Jean-Jacques Quisquater. A security analysis of the cliques protocols suites. In 14th IEEE Computer Security Foundations Workshop - CSFW'01, pages 73-81, Cape Breton, Canada, 11-13 June 2001. IEEE Computer Society Press.
11. F. Javier THAYER Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Mixed strand spaces. In Proceedings of the 12th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, June 1999.
12. F. Javier THAYER Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: Proving security protocols correct. Journal of Computer Security, 7(2/3):191-230, 1999.
13. T. Ylonen, T. Kivinen, and M. Saarinen. SSH transport layer prototcol. Internet draft, November 1997. Also named draft-ietf-secsh-transport-01.txt.