Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation

Journal of Computer Security

Volumn 13, Issue 3, 2005, Pages 515-564

  Millen, Jonathan ^a   Shmatikov, Vitaly ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PROBLEM SOLVING;

CRYPTOGRAPHIC PROTOCOLS; DIOPHANTINE EQUATIONS; SOLVABILITY;

NETWORK PROTOCOLS;

EID: 24144477933     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2005-13306     Document Type: Conference Paper

References (34)

1. R. Amadio and D. Lugiez, On the reachability problem in cryptographic protocols, in: Proc. 11th International Conference on Concurrency Theory (CONCUR '00), Volume 1877 of LNC5, Springer-Verlag, 2000, pp. 380-394.
2. M. Abadi and P. Rogaway, Reconciling two views of cryptography, J. Cryptology 15(2) (2002), 103-127.
3. M. Boreale and M. Buscemi, On the symbolic analysis of low-level cryptographic primitives: modular exponentiation and the Diffie-Hellman protocol, in: Proc. Workshop on the Foundations of Computer Security (FCS), 2003.
4. I.C. Bertolotti, L. Durante, R. Sisto and A. Valenzano, Introducing commutative and associative operators in cryptographic protocol analysis, in: Proc. 23rd International Conference on Formal Techniques for Networked and Distributed Systems (FORTE '03), Volume 2767 of LNCS, Springer-Verlag, 2003, pp. 224-239.
5. D. Basin, S. Mödersheim and L. Vigano, Constraint differentiation: a new reduction technique for constraint-based analysis of security protocols, in: Proc, 10th ACM Conference on Computer and Communications Security (CCS'03), 2003, pp. 335-344.
6. M. Boreale, Symbolic trace analysis of cryptographic protocols, in: Proc. 28th International Colloquium on Automata, Languages and Programing (ICALP '01), Volume 2076 of LNCS, Springer-Verlag, 2001, pp. 667-681.
7. F. Baader and W. Snyder, Unification theory, in: Handbook of Automated Reasoning, A. Robinson and A. Voronkov, eds, Volume 1, Chapter 8, Elsevier Science, 2001, pp. 445-532.
8. H. Comon, V. Cortier and J.C. Mitchell, Tree automata with one memory, set constraints, and ping-pong protocols, in: Proc. 28th International Colloquium on Automata, Languages and Programming (ICALP '01), Volume 2076 of LNCS, Springer-Verlag, 2001, pp. 682-693.
9. E. Contejean and H. Devie, An efficient algorithm for solving systems of Diophantine equations, Information and Computation 113(1) (1994), 143-172.
10. R. Corin and S. Etalle, An improved constraint-based system for the verification of security protocols, in: Proc. 9th International Static Analysis Symposium (SAS '02), Volume 2477 of LNCS, Springer-Verlag, 2002, pp. 326-341.
11. E.M. Clarke, S. Jha and W. Marrero, Verifying security protocols with Brutus, ACM Transactions in Software Engineering Methodology (TOSEM) 9(4) (2000), 443-487.
12. Y. Chevalier, R. Küters, M. Rusinowitch and M. Turuani, Deciding the security of protocols with Diffie-Hellman exponentiation and products in exponents, Technical Report IFI-Report 0305, CAU Kiel, 2003.
13. Y. Chevalier, R. Küsters, M. Rusinowitch and M. Turuani, An NP decision procedure for protocol insecurity with XOR, in: Proc. 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), 2003, pp. 261-270.
14. H. Comon-Lundh and V. Shmatikov, Intruder deductions, constraint solving and insecurity decision in presence of exclusive or, in: Proc. 18th Annual IEEE Symposium on Logic in Computer Science. (LICS'03), 2003, pp. 271-280.
15. N. Durgin, P.D. Lincoln, J.C. Mitchell and A. Scedrov, Undecidability of bounded security protocols, in: Proc. FLOC Workshop on Formal Methods in Security Protocols, 1999.
16. D. Dolev and A. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(2) (1983), 198-208.
17. M. Fiore and M. Abadi, Computing symbolic models for verifying cryptographic protocols, in: Proc. 14th IEEE Computer Security Foundations Workshop, 2001, pp. 160-173.
18. D. Kapur, P. Narendran and L. Wang, A unification algorithm for analysis of protocols with blinded signatures, Technical Report 02-5, SUNY Albany, 2002.
19. D. Kapur, P. Narendran and L. Wang, An e-unification algorithm for analyzing protocols that use modular exponentiation, in: Proc. 14th International Conference on Rewriting Techniques and Applications (RTA '03), Volume 2706 of LNCS, Springer-Verlag, 2003, pp. 165-179.
20. L. Lamport, Time, clocks and the ordering of events in a distributed system, Comms. ACM 21(7) (1978), 558-565.
21. P. Lincoln and J. Christian, Adventures in associative-communtative unification, J. Symb. Comput. 8(1-2) (1989), 217-240.
22. J. Millen, On the freedom of decryption, Information Processing Letters 86(6) (2003), 329-333.
23. 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.
24. J. Millen and V. Shmatikov, Constraint solving for bounded process cryptographic protocol analysis, in: Pros. 8th ACM Conference on Computer and Communications Security (CCS'01), 2001, pp. 166-175.
25. L. Paulson, Mechanized proofs for a recursive authentication protocol, in: Proc. 10th IEEE Computer Security Foundations Workshop, 1997, pp. 84-95.
26. L. Paulson, The inductive approach to verifying cryptographic protocols, J. Computer Security 6(1/2) (1998), 85-128.
27. O. Pereira and J.-J. Quisquater, A security analysis of the Cliques protocols suites, in: Proc. 14th IEEE Computer Security Foundations Workshop, 2001, pp. 73-81.
28. P. Ryan and S. Schneider, An attack on a recursive authentication protocol: A cautionary tale, Information Processing Letters 65(1) (1998), 7-10.
29. M. Rusinowitch and M. Turuani, Protocol insecurity with finite number of sessions is NP-complete, in: Proc. 14th IEEE Computer Security Foundations Workshop, 2001, pp. 174-190.
30. V. Shmatikov, Decidable analysis of cryptographic protocols with products and modular exponentiation, in: Proc. 13th European Symposium on Programming (ESOP '04), Volume 2986 of LNCS, Springer-Verlag, 2004, pp. 355-369.
31. D. Song, Athena: a new efficient automatic checker for security protocol analysis, in: Proc. 12th IEEE Computer Security Foundations Workshop, 1999, pp. 192-202.
32. M. Schmidt-Schauss, Unification in a combination of arbitrary disjoint equational theories, J. Symbolic Computation 8 (1989), 51-99.
33. 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), 1996, pp. 31-37.
34. F. Thayer, J. Herzog and J. Guttman, Strand spaces: proving security protocols correct? J. Computer Security 7(1) (1999).