On the Existence of an Effective and Complete Inference System for Cryptographic Protocols (Extended Abstract)

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

Volumn 2987, Issue , 2004, Pages 42-57

  Bozga, Liana ^a   Ene, Cristian ^a   Lakhnech, Yassine ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; CRYPTOGRAPHY; FORMAL LOGIC; SEMANTICS;

CRYPTOGRAPHIC PROTOCOLS; EXTENDED ABSTRACTS; INFERENCE SYSTEMS; PROGRAM SEMANTICS; PROGRAM VERIFICATION; SECOND-ORDER LOGIC;

CALCULATIONS;

EID: 35048883478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_5     Document Type: Article

References (21)

1. R. M. Amadio and D. Lugiez. On the reachability problem in cryptographic protocols. In International Conference on Concurrency Theory, volume 1877 of LNCS, pages 380-394, 2000.
2. B. Blanchet and A. Podelski. Verification of cryptographic protocols: Tagging enforces termination. In Andrew D. Gordon, editor, FoSSaCS'03: Foundations of Software Science and Computation Structures, volume 2620 of LNCS, pages 136152. Springer, 2003.
3. M. Boréale. Symbolic trace analysis of cryptographic protocols. In ICALP: Annual International Colloquium on Automata, Languages and Programming, 2001.
4. L. Bozga, Y. Lakhnech, and M. Périn. Abstract interpretation for secrecy using patterns. In TACAS'03, volume 2619 of LNCS, 2003.
5. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. ACM Transactions on Computer Systems, 8(l):18-36, February 1990.
6. H. Comon. Disunification: A survey. In Computational Logic: Essays in Honor of Alan Robinson. MIT Press, Cambridge, MA, 1991.
7. H. Comon and V. Shmatikov. Is it possible to decide whether a cryptographic protocol is secure or not? Journal of Telecommunications and Information Technology, 2002.
8. H. Comon-Lundh and V. Cortier. New decidability results for fragments of firstorder logic and application to cryptographic protocols. In 14th Int. Conf. Rewriting Techniques and Applications (RTA'2003), volume 2706 of LNCS, 2003.
9. P. Cousot. Methods and Logics for Proving Programs. In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 841-994. Elsevier Science Publishers B. V., 1990.
10. D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
11. F.J.T. Fábrega, J.C. Herzog, and J.D. Guttman. Strand Spaces: Why is a Security Protocol Correct ? In IEEE Conference on Security and Privacy, pages 160-171, 1998.
12. M. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In 14th IEEE Computer Security Foundations Workshop (CSFW '01), pages 160-173, Washington - Brussels - Tokyo, June 2001. IEEE.
13. J.-P. Jouannaud and C. Kirchner. Solving equations in abstract algebras: A rulebased survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.
14. G. Lowe. A hierarchy of authentication specifications. In 10th IEEE Computer Security Foundations Workshop (CSFW '97), pages 31-44, Washington - Brussels - Tokyo, June 1997. IEEE.
15. C. Meadows. Formal methods for cryptographic protocol analysis: Emerging issues and trends. IEEE Journal on Selected Areas in Communication, 21(l):44-54, January 2003.
16. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In ACM Conference on Computer and Communications Security, pages 166-175, 2001.
17. A. W. Roscoe. Intensional specification of security protocols. In 9th IEEE Computer Security Foundations Workshop (CSFW '96), pages 28-38, Washington Brussels - Tokyo, June 1996. IEEE.
18. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In IEEE Computer Security Foundations Workshop, 2001.
19. S. Schneider. Verifying authentication protocols with CSP. In 10th IEEE Computer Security Foundations Workshop (CSFW '97), pages 3-17, Washington - Brussels Tokyo, June 1997. IEEE.
20. J. Thayer, J. Herzog, and J. Guttman. Honest Ideals on Strand Spaces. In IEEE Computer Security Foundations Workshop, pages 66-78, 1998.
21. Thomas Y. C. Woo and Simon S. Lam. Authentication for distributed systems. Computer, 25(l):39-52, January 1992.