Automatic Verification of Cryptographic Protocols: A Logic Programming Approach

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 1-3

  Blanchet, Bruno ^a,b  

^a CNRS   (France)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Automatic verification; Cryptographic protocols; Horn clauses; Logic programming

Indexed keywords

AUTOMATIC VERIFICATION; HORN CLAUSES;

AUTOMATION; COMPUTATIONAL METHODS; CRYPTOGRAPHY; NETWORK PROTOCOLS; PARAMETER ESTIMATION; SECURITY OF DATA;

LOGIC PROGRAMMING;

EID: 1242332714     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. M. Abadi and B. Blanchet. Analyzing Security Protocols with Secrecy Types and Logic Programs. In 29th Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages (POPL 2002), pages 33-44. ACM, Jan. 2002.
2. M. Abadi and B. Blanchet. Computer-Assisted Verification of a Protocol for Certified Email. In R. Cousot, editor, Static Analysis, 10th International Symposium (SAS'03), volume 2694 of LNCS, pages 316-335. Springer, June 2003.
3. M. Abadi and C. Fournet. Mobile Values, New Names, and Secure Communication. In 28th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'01), pages 104-115. ACM, Jan. 2001.
4. M. Abadi and A. D. Gordon. A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation, 148(1):1-70, Jan. 1999. An extended version appeared as Digital Equipment Corporation Systems Research Center report No. 149, January 1998.
5. M. Abadi and P. Rogaway. Reconciling two views of cryptography (The computational soundness of formal encryption). In Proceedings of the First IFIP International Conference on Theoretical Computer Science, volume 1872 of LNCS, pages 3-22. Springer, Aug. 2000.
6. B. Blanchet. From Secrecy to Authenticity in Security Protocols. In M. Hermenegildo and G. Puebla, editors, 9th International Static Analysis Symposium (SAS'02), volume 2477 of LNCS, pages 342-359. Springer, Sept. 2002.
7. B. Blanchet and A. Podelski. Verification of Cryptographic Protocols: Tagging Enforces Termination. In A. Gordon, editor, Foundations of Software Science and Computation Structures (FoSSaCS'03), volume 2620 of LNCS, pages 136-152. Springer, Apr. 2003.
8. H. Comon-Lundh and V. Cortier. New decidability results for fragments of first-order logic and application to cryptographic protocols. In R. Nieuwenhuis, editor, In Proc. 14th Int. Conf. Rewriting Techniques and Applications (RTA'2003), volume 2706 of LNCS. Springer, June 2003.
9. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IT-29(12):198-208, Mar. 1983.
10. N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Workshop on Formal Methods and Security Protocols (FMSP'99), 5 July 1999.
11. P. Laud. Handling Encryption in an Analysis for Secure Information Flow. In P. Degano, editor, Programming Languages and Systems, 12th European Symposium on Programming, ESOP'03, volume 2618 of LNCS, pages 159-173. Springer, Apr. 2003.
12. G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of LNCS, pages 147-166. Springer, 1996.
13. R. M. Needham and M. D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. Commun. ACM, 21(12):993-999, Dec. 1978.
14. C. Weidenbach. Towards an Automatic Analysis of Security Protocols in First-Order Logic. In H. Ganzinger, editor, 16th International Conference on Automated Deduction (CADE-16), volume 1632 of LNAI, pages 314-328. Springer, July 1999.
15. T. Y. C. Woo and S. S. Lam. A Semantic Model for Authentication Protocols. In Proceedings IEEE Symposium on Research in Security and Privacy, pages 178-194, May 1993.