On the reachability problem in cryptographic protocols

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

Volumn 1877 LNCS, Issue , 2000, Pages 380-394

  Amadio, Roberto M ^a   Lugiez, Denis ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Cryptographic protocols; Symbolic computation; Verification

Indexed keywords

COMPUTATION THEORY; VERIFICATION;

CRYPTOGRAPHIC PROTOCOLS; DECISION PROCEDURE; PARALLEL PROGRAM; REACHABILITY PROBLEM; REDUCTION SYSTEMS; SYMBOLIC COMPUTATION;

CRYPTOGRAPHY;

EID: 84885216561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_28     Document Type: Conference Paper

References (19)

1. M. Abadi and A. Gordon. A calculus for cryptographic protocols: the spi calculus. In Proc. ACM Computer and Comm. Security, 1997.
2. R. Amadio and S. Prasad. The game of the name in cryptographic tables. In Proc. ASIAN99, SLNCS 1742, pages 15-26, 1999.
3. M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. In Proc. IEEE Logic in Comp. Sci., 1999.
4. D. Bolignano. Formal verification of cryptographic protocols. In Proc. ACM Conference on Computer Communication and Security, 1996.
5. M. Boreale. Symbolic analysis of cryptographic protocols in the spi-calculus. Personal communication, 2000.
6. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Draft available at http://www.grappa.univ-lille3.fr/tata.
7. J. Clark and J. Jacob. A survey of authentication protocol literature: Version 1.0. Technical report, 1997. Available at http://www.cs.york.ac.uk/~jac/ papers/drareview.ps.gz.
8. E. Clarke, S. Jha, and W. Marrero. Usingstate space exploration and a natural deduction style message derivation engine to verify security protocols. In Proc. IFIP Conf. on Progr. Concepts and Methods (PROCOMET), 1998.
9. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Undecidability of bounded security protocols. In Proc. Formal methods and security protocols, FLOC Workshop, Trento, 1999.
10. D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. on Information Theory, 29(2): 198-208, 1983.
11. A. Huima. Efficient infinite-state analysis of security protocols. In Proc. Formal methods and security protocols, FLOC Workshop, Trento, 1999.
12. G. Lowe. Breakingand fixingthe Needham-Schroeder public-key protocol using FDR. In Proc. TACAS, SLNCS, 1996.
13. C. Meadows. A model of computation for the nrl protocol analyzer. In Proc. IEEE Computer Security Foundations Workshop, 1994.
14. J. Mitchell, M. Mitchell, and U. Stern. Automated analysis of cryptographic protocols usingmurφ. In Proc. IEEE Symp. on Security and Privacy, 1997.
15. D. Monniaux. Abstractingcryptographic protocols with tree automata. In Proc. Static Analysis Symp., SLNCS, 1999.
16. L. Paulson. Provingproperties of security protocols by induction. In Proc. IEEE Computer Security Foundations Workshop, 1997.
17. L. Paulson. Provingsecurity protocols correct. In Proc. IEEE Logic in Comp. Sci., 1999.
18. S. Schneider. Security properties and CSP. In Proc. IEEE Symp. Security and Privacy, 1996.
19. C. Weidenbach. Towards an automatic analysis of security protocols in first-order logic. In Proc. CADE 99. SLNCS 1632, 1999.