Decidable analysis of cryptographic protocols with products and modular exponentiation

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

Volumn 2986, Issue , 2004, Pages 355-369

  Shmatikov, Vitaly ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GROUP THEORY;

ALGEBRAIC PROPERTIES; ANALYSIS OF PROTOCOLS; CRYPTOGRAPHIC PROTOCOLS; LINEAR DIOPHANTINE EQUATIONS; MODULAR EXPONENTIATION; MODULAR MULTIPLICATION; REACHABILITY PROBLEM; SOUND AND COMPLETE;

COMPUTABILITY AND DECIDABILITY;

EID: 35048827395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24725-8_25     Document Type: Article

References (19)

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 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. 28th International Colloquium on Automata, Languages and Programming (ICALP '01), volume 2076 of LNCS, pages 667-681, 2001.
4. 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 (PCS), 2003.
5. Y. Chevalier, R. Küsters, 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.
6. 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), pages 271-280, 2003.
7. E. Contejean and H. Devie. An efficient algorithm for solving systems of Diophantine equations. Information and Computation, 113(1):143-172, 1994.
8. N. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov. Undccidability of bounded security protocols. In Proc. FLOC Workshop on Formal Methods in Security Protocols, 1999.
9. M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In Proc. 14th IEEE Computer Security Foundations Workshop, pages 160-173, 2001.
10. 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, pages 165-179, 2003.
11. C. Meadows and P. Narendran. A unification algorithm for the group DiffieHellman protocol. In Proc. Workshop of Issues in Theory of Security (WITS), 2002.
12. A. Menezes, P. van Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
13. 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.
14. J. Millen and V. Shmatikov. Symbolic protocol analysis with products and DiffieHellman exponentiation. In Proc. 16th IEEE Computer Security Foundations Workshop, pages 47-61, 2003.
15. L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proc. 10th IEEE Computer Security Foundations Workshop, pages 84-95, 1997.
16. 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.
17. 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.
18. P. Ryan and S. Schneider. An attack on a recursive authentication protocol: A cautionary tale. Information Processing Letters, 65(1):7-10, 1998.
19. 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.