Introducing commutative and associative operators in cryptographic protocol analysis

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

Volumn 2767, Issue , 2003, Pages 224-239

  Bertolotti, Ivan Cibario ^a   Durante, Luca ^a   Sisto, Riccardo ^b   Valenzano, Adriano ^a  

^a CNR   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MODEL CHECKING;

ASSOCIATIVITY; AUTOMATIC MODELING; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; DIFFIE-HELLMAN KEY EXCHANGE PROTOCOL; FORMAL TECHNIQUES; PUBLIC-KEY ENCRYPTION; SPECIAL PROPERTIES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33645604225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (21)

1. Martin Abadi and Andrew D. Gordon. A calculus for cryptographic protocols. The spi calculus. Information and Computation, 148(1):1-70, January 1999.
2. Michele Boreale and Maria Grazia Buscemi. A framework for the analysis of security protocols. In Proceedings of CONCUR'01. Springer-Verlag, 2002.
3. Michele Boreale, Rocco De Nicola, and Rosario Pugliese. Proof techniques for cryptographic processes. In Proceedings of 14th IEEE LICS, pages 157-166. IEEE Computer Society Press, 1999.
4. Yannick Chevalier, Ralf Küsters, Michael Rusinowitch, and Mathieu Turuani. An NP decision procedure for protocol insecurity with XOR, 2003. To appear in Proc. of 18th IEEE LICS'2003.
5. Ivan Cibrario Bertolotti, Luca Durante, Riccardo Sisto, and Adriano Valenzano. A new knowledge representation strategy for cryptographic protocol analysis. In Proceedings of TACAS'03, volume 2619 of Lecture Notes in Computer Science, pages 284-298. Springer-Verlag, April 2003.
6. E. M. Clarke, S. Jha, and W. Marrero. Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In Proceedings of IFIP PROCOMET, pages 87-106, London, 1998. Chapman & Hall.
7. E. M. Clarke, S. Jha, and W. Marrero. Verifying security protocols with Brutus. ACM Transactions on Software Engineering and Methodology, 9(4):443-487, October 2000.
8. H. Comon-Lundh and V. Shmatikov. Constraint solving and insecurity decision in presence of exclusive or, June 2003. To appear in Proc. of 18th IEEE LICS'2003.
9. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6):644-654, November 1976.
10. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
11. Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In T. Margaria and B. Steffen, editors, Proceedings of TACAS'96, volume 1055 of Lecture Notes in Computer Science, pages 147-166. Springer-Verlag, 1996.
12. Gavin Lowe. Casper: a compiler for the analysis of security protocols. In Proceedings of 10th IEEE CSFW, pages 18-30. IEEE Computer Society Press, June 1997.
13. Gavin Lowe. Towards a completeness result for model checking security protocols. Journal of Computer Security, 7(2-3):89-146, 1999.
14. W. Marrero, E. M. Clarke, and S. Jha. A model checker for authentication protocols. In DIMACS Workshop on Design and Formal Verification of Security Protocols, 1997.
15. Catherine Meadows and Paliath Narendran. A unification algorithm for the group Diffie-Hellman protocol. In Proceedings of WITS'02, 2002.
16. Jonathan Millen and Vitaly Shmatikov. Symbolic protocol analysis with products and Diffie-Hellman exponentiation, June 2003. To appear in Proc. of 16th IEEE CSFW.
17. Jonathan K. Millen, S. C. Clark, and S. B. Freedman. The Interrogator: Protocol security analysis. IEEE Transactions on Software Engineering, 13(2):274-288, February 1987.
18. David Monniaux. Abstracting cryptographic protocols with tree automata. In Sixth International Static Analysis Symposium (SAS'99), number 1694 in Lecture Notes in Computer Science, pages 149-163. Springer Verlag, 1999.
19. Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85-128, 1998.
20. Michaël Rusinowitch and Mathieu Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proceedings of 14th IEEE CSFW, pages 174-187. IEEE Computer Society Press, June 2001.
21. Steve Schneider. Verifying authentication protocols in CSP. IEEE Transactions on Software Engineering, 24(9):741-758, September 1998.