Searching for shapes in cryptographic protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 523-537

  Doghmi, Shaddin F ^a   Guttman, Joshua D ^a   Thayer, F Javier ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; SEARCH ENGINES; ARTIFICIAL INTELLIGENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOL SHAPE ANALYZER; SECRECY PROPERTIES; CRYPTOGRAPHIC PROTOCOLS; NATURALLY OCCURRING;

NETWORK PROTOCOLS; CRYPTOGRAPHY;

EID: 35048899619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_41     Document Type: Conference Paper

References (21)

1. Martín Abadi and Bruno Blanchet. Analyzing security protocols with secrecy types and logic programs. Journal of the ACM, 52(1):102-146, January 2005.
2. Roberto M. Amadio and Denis Lugiez. On the reachability problem in cryptographic protocols. In Concur, number 1877 in LNCS, pages 380-394, 2000.
3. Michael Backes and Birgit Pfitzmann. Relating cryptographic and symbolic key secrecy. In Proceedings, 26th IEEE Symposium on Security and Privacy, May 2005. Extended version, http://eprint.iacr.org/2004/300.
4. Bruno Blanchet and Andreas Podelski. Verification of cryptographic protocols: Tagging enforces termination. In Foundations of Software Science and Computation Structures, LNCS, pages 136-152, April 2003.
5. Ran Canetti and Jonathan Herzog. Universally composable symbolic analysis of mutual authentication and key exchange protocols. In Proceedings, Theory of Cryptography Conference (TCC), March 2006.
6. Shaddin F. Doghmi, Joshua D. Guttman, and F. Javier Thayer. Searching for shapes in cryptographic protocols (extended version). URL:http://eprint.iacr. org/2006/435, November 2006.
7. Daniel Dolev and Andrew Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 29:198-208, 1983.
8. Nancy Durgin, Patrick Lincoln, John Mitchell, and Andre Scedrov. Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security, 12(2):247-311, 2004.
9. Andrew D. Gordon and Alan Jeffrey. Types and effects for asymmetric cryptographic protocols. Journal of Computer Security, 12(3/4):435-484, 2003.
10. Joshua D. Guttman and F. Javier Thayer. Authentication tests and the structure of bundles. Theoretical Computer Science, 283(2):333-380, June 2002.
11. Conference version appeared in IEEE Symposium on Security and Privacy, May 2000.
12. Jonathan C. Herzog. The Diffie-Hellman key-agreement scheme in the strandspace model. In 16th Computer Security Foundations Workshop, pages 234-247, Asilomar, CA, June 2003. IEEE CS Press.
13. ITU. Message sequence chart (MSC). Recommendation Z.120, 1999.
14. Leslie Lamport. Time, clocks and the ordering of events in a distributed system. CACM, 21(7):558-565, 1978.
15. Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proceeedings of TACAS, volume 1055 of Lecture Notes in Computer Science, pages 147-166. Springer Verlag, 1996.
16. Jonathan K. Milien and Vitaly Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In 8th ACM Conference on Computer and Communications Security (CCS '01), pages 166-175. ACM, 2001.
17. Roger Needham and Michael Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12), 1978.
18. Lawrence C. Paulson. Relations between secrets: Two formal analyses of the Yahalom protocol. Journal of Computer Security, 2001.
19. Adrian Perrig and Dawn Xiaodong Song. Looking for diamonds in the desert: Extending automatic protocol generation to three-party authentication and key agreement protocols. In Proceedings of the 13th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, July 2000.
20. R. Ramanujam and S. P. Suresh. Decidability of context-explicit security protocols. Journal of Computer Security, 13(1): 135-166, 2005.
21. Preliminary version appeared in WITS '03, Workshop on Issues in the Theory of Security, Warsaw, April 2003.