Proof techniques for cryptographic protocols

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

Volumn 1644 LNCS, Issue , 1999, Pages 25-39

  Compton, Kevin J ^a,b   Dexter, Scott ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b University of Michigan   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; LOGIC PROGRAMMING;

CRYPTOGRAPHIC PROTOCOLS; LINEAR LOGIC PROGRAMMING;

CRYPTOGRAPHY;

EID: 84887442584     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_3     Document Type: Conference Paper

References (45)

1. J.-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3), 1992.
2. G. Bella and L. C. Paulson. Using Isabelle to prove properties of the Kerberos authentication system. In Proceedings of the DIMACS Workshop on Formal Verification of Cryptographic Protocols, September 1997.
3. M. Bellare and P. Rogaway. Entity authentication and key distribution. In Advances in Cryptology Crypto '93 Proceedings, 1993.
4. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designingeficient protocols. In Proceedings of the First ACM Conference on Computer and Communications Security, 1993.
5. M. Bellare and P. Rogaway. Provably secure session key distribution the three party case. In Proceedings of the 27th ACM Symposium on the Theory of Computing, 1995.
6. D. Bolignano. An approach for the formal verification of cryptographic protocols. In Proceedings of the Third ACM Conference on Computer and Communications Security, pages 106-118. ACM Press, 1996.
7. D. Bolignano. Towards a mechanization of cryptographic protocol verification. In Proceedings of the 9th International Computer-Aided Verification Conference, June 1997.
8. C. Boyd. Towards extensional goals in authentication protocols. Preprint.
9. J. Bryans and S. Schneider. CSP, PVS, and a recursive authentication protocol. In Proceedings of the DIMACS Workshop on Formal Verification of Cryptographic Protocols, September 1997.
10. J. A. Bull and D. J. Otway. The authentication protocol. Technical Report CSM/436-04/03, Defence Research Agency, Malvern, UK, 1997.
11. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Transactions on Computer Systems, 8, February 1990.
12. S. Cerrito. Herbrand methods in sequent calculi: Unification in LL. In K. Apt, editor, Logic Programming: Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 607-621. The MIT Press, 1992.
13. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A meta-notation for protocol analysis. Preprint.
14. D. E. Denning and G. M. Sacco. Timestamps in key distribution protocols. Communications of the ACM, 24(8):533-536, 1981.
15. S. D. Dexter. An Adversary-Centric Logic of Security and Authenticity. PhD thesis, University of Michigan, 1998.
16. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(2):198-208, March 1983.
17. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
18. L. Gong, R. Needham, and R. Yahalom. Reasoning about belief in cryptographic protocols. In Proceedings of the IEEE Computer Society Symposium on Security and Privacy, pages 234-248. IEEE, May 1990.
19. J. Harland and D. Pym. A uniform proof-theoretic investigation of linear logic programming. Journal of Logic and Computation, 4(2), April 1994. 175-207.
20. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
21. J. S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 110(2):327-365, May 1994.
22. R. Kemmerer, C. Meadows, and J. Millen. Three systems for cryptographic protocol analysis. Journal of Cryptology, 7:79-130, 1994.
23. J. W. Lloyd. Foundations of Logic Programming. Spinger-Verlag, second extended edition edition, 1993.
24. G. Lowe. Breaking and fixing the Needham-Schroeder public key protocol using CSP and FDR. In T. Margaria and B. Stefien, editors, Tools and Algorithms for the Construction and Analysis of Systems Second International Workshop, TACAS '96, volume 1055 of Lecture Notes in Computer Science, pages 147-166. SpringerVerlag, 1996.
25. G. Lowe. A hierarchy of authentication specification. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, June 1997.
26. G. Lowe. Some new attacks upon security protocols. In Proceedings of the 9th IEEE Computer Security Foundations Workshop, pages 162-169, 1997.
27. J. A. Makowsky. Why Horn formulas matter in computer science: Initial structures and generic examples. Journal of Computer and System Sciences, 34:266-292, 1987.
28. W. Mao and C. Boyd. Development of authentication protocols: Some misconceptions and a new approach. In Proceedings of the Computer Security Foundations Workshop VII, pages 178-186. IEEE, 1994.
29. W. Marrero, E. Clarke, and S. Jha. Model checking for security protocols. Technical Report CMU-CS-97-139, School of Computer Science, Carnegie Mellon University, May 1997.
30. C. Meadows. The NRL protocol analyzer: An overview. The Journal of Logic Programming, pages 113-131, 1996.
31. J. C. Mitchell. Analysis of security protocols. Slides for a talk at CAV '98, available at http://www.stanford.edu/jcm, July 1998.
32. R. M. Needham and M. D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993-999, 1978.
33. P. Padawitz. Computing in Horn clause theories. Springer-Verlag, Berlin, 1988.
34. L. C. Paulson. Proving properties of security protocols by induction. Technical Report TR-409, Computer Laboratory, University of Cambridge, 1996.
35. L. C. Paulson. Mechanized proofs for a recursive authentication protocol. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 84-95, June 1997.
36. L. C. Paulson. Mechanized proofs of security protcols: Needham-Schroeder with public keys. Unpublished manuscript, January 1997.
37. A. W. Roscoe. Modelling and verifying key exchange protocols using CSP and FDR. In Proceedings of the Computer Security Foundations Workshop VIII, volume 8, pages 98-107. IEEE, 1995.
38. P. Ryan and I. Zakiuddin. Modelling and analysis of security protocols. In Proceedings of the DIMACS Workshop on Formal Verification of Security Protocols, September 1997.
39. E. Snekkenes. Exploring the BAN approach to protocol analysis. In Proceedings of the IEEE Computer Society Symposium on Security and Privacy, pages 171-181, May 1991.
40. P. Syverson. The use of logic in the analysis of cryptographic protocols. In Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy, pages 156-170. IEEE, May 1991.
41. P. Syverson and P. Oorschot. On unifying some cryptographic protocol logics. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 14-28, 1994.
42. T. Tammet. Proof strategies in linear logic. Journal of Automated Reasoning, 12:273-304, 1994.
43. P. C. Oorschot. Extending cryptographic logics of belief to key agreement protocols (extended abstract). In Proceedings of the First ACM Conference on Computer and Communications Security, pages 232-243, November 1993.
44. M. Winikofi and J. Harland. Some applications of the linear logic programming language lygon. In Proceedings of the Australasian Computer Science Conference, pages 262-271, February 1996.
45. T. Y. C. Woo and S. S. Lam. A semantic model for authentication protocols. In Proceedings of the Symposium on Research in Security and Privacy, pages 178-194. IEEE, May 1993.