Symbolic protocol analysis with products and Diffie-Hellman exponentiation

Proceedings of the Computer Security Foundations Workshop

Volumn 2003-January, Issue , 2003, Pages 47-61

  Millen, J ^a   Shmatikov, V ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

Access protocols; Algebra; Authentication; Computer science; Cryptographic protocols; Cryptography; Data security; Equations; Interleaved codes; Laboratories

Indexed keywords

ALGEBRA; AUTHENTICATION; COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; CRYPTOGRAPHY; LABORATORIES; SECURITY OF DATA; SECURITY SYSTEMS;

ACCESS PROTOCOLS; CRYPTOGRAPHIC PROTOCOLS; DIOPHANTINE EQUATION; EQUATIONS; INTERLEAVED CODES; PROTOCOL ANALYSIS; PROTOCOL INSECURITY; REACHABILITY PROBLEM;

GROUP THEORY;

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

References (25)

1. R. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In Proc. CONCUR '00, volume 1877 of LNCS, pages 380-394, 2000.
2. F. Baader and W. Snyder. Unification theory. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume 1, chapter 8, pages 445-532. Elsevier Science, 2001.
3. M. Boreale. Symbolic trace analysis of cryptographic protocols. In Proc. ICALP '01, pages 667-681, 2001.
4. Y. Chevalier, R. Küsters, M. Rusinowitch, and M. Turuani. An NP decision procedure for protocol insecurity with XOR. In Proc. LICS '03 (to appear), 2003.
5. E. Clarke, S. Jha, and W. Marrero. Verifying security protocols with Brutus. ACM Transactions in Software Engineering Methodology (TOSEM), 9(4):443-487, 2000.
6. H. Comon, V. Cortier, and J. Mitchell. Tree automata with one memory, set constraints, and ping-pong protocols. In Proc. ICALP '01, pages 682-693, 2001.
7. H. Comon-Lundh and V. Shmatikov. Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In Proc. LICS '03 (to appear), 2003.
8. E. Contejean and H. Devie. An efficient algorithm for solving systems of Diophantine equations. Information and Computation, 113(1):143-172, 1994.
9. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. FLOC Workshop on Formal Methods in Security Protocols, 1999.
10. M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 160-173, 2001.
11. K. Ito, editor. Encyclopedic Dictionary of Mathematics. Springer-Verlag, 2nd edition, 1994.
12. D. Kapur, P. Narendran, and L. Wang. A unification algorithm for analysis of protocols with blinded signatures. Technical Report TR 02-5, Department of Computer Science, SUNY Albany, 2002.
13. D. Kapur, P. Narendran, and L. Wang. Analyzing protocols that use modular exponentiation: Semantic unification techniques. In Proc. RTA '03 (to appear), 2003.
14. L. Lamport. Time, clocks and the ordering of events in a distributed system. Comms. ACM, 21(7):558-565, 1978.
15. C. Meadows and P. Narendran. A unification algorithm for the group Diffie-Hellman protocol. In Proc. Workshop of Issues in Theory of Security (WITS), 2002.
16. J. Millen and V. Shmatikov. Constraint solving for bounded process cryptographic protocol analysis. In Proc. 8th ACM Conference on Computer and Communications Security (CCS '01), pages 166-175, 2001.
17. L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proc. 10th IEEE Computer Security Foundations Workshop, pages 84-95, 1997.
18. L. Paulson. The inductive approach to verifying cryptographic protocols. J. Computer Security, 6(1/2):85-128, 1998.
19. O. Pereira and J.-J. Quisquater. A security analysis of the Cliques protocols suites. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 73-81, 2001.
20. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 174-190, 2001.
21. P. Ryan and S. Schneider. An attack on a recursive authentication protocol: A cautionary tale. Information Processing Letters, 65(1):7-10, 1998.
22. D. Song. Athena: a new efficient automatic checker for security protocol analysis. In Proc. 12th IEEE Computer Security Foundations Workshop, pages 192-202, 1999.
23. M. Steiner, G. Tsudik, and M. Waidner. Diffie-Hellman key distribution extended to group communication. In Proc. 3rd ACM Conference on Computer and Communications Security (CCS '96), pages 31-37, 1996.
24. F. Thayer, J. Herzog, and J. Guttman. Strand spaces: proving security protocols correct? J. Computer Security, 7(1), 1999.
25. S. Wolfram. A New Kind of Science. Wolfram Media, 2002.