The coinductive approach to verifying cryptographic protocols

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

Volumn 2755, Issue , 2003, Pages 268-283

  Hughes, Jesse ^a   Warnier, Martijn ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATION LANGUAGES;

COALGEBRAIC CLASS SPECIFICATION LANGUAGES; CRYPTOGRAPHIC PROTOCOLS; PROTOCOL VERIFICATION; REAL-LIFE NETWORKS; TEMPORAL OPERATORS; THEOREM PROVERS;

CRYPTOGRAPHY;

EID: 0346955916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40020-2_15     Document Type: Article

References (15)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, pages 36-47. ACM Press, April 1997.
2. M. Burrows, M. Abadi, and R. Needham. A logic of authentication. Proc. Royal Soc., Series A, Volume 426:233-271, 1989.
3. ∼jac/papers/ drareview.ps.gz.
4. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(6), 1983.
5. Gavin Lowe. An attack on the Needham-Schroeder public-key authentication protocol. Information Processing Letters, 56:131-133, 1990.
6. Gavin Lowe. Casper: A compiler for the analysis of security protocols. In PCSFW: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.
7. J. Millen and V. Shmatikov. Constraint solving for bounded-process cryptographic protocol analysis. In 8th ACM Conference on Computer and Communication Security, pages 166-175. ACM SIGSAC, November 2001.
8. 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.
9. S. Owre, J.M. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Trans. on Softw. Eng., 21(2):107-125, 1995.
10. L.C. Paulson. Isabelle: A Generic Theorem Prover. Number 828 in Lect. Notes Comp. Sci. Springer, Berlin, 1994.
11. L.C. Paulson. The inductive approach to verifying cryptographic protocols. Journ. of Computer Security, 6:85-128, 1998.
12. J. Rothe, H. Tews, and B. Jacobs. The coalgebraic class specification language CCSL. Journal of Universal Comp. Sci., 7(2), 2001.
13. N. Shanker, S. Owre, J.M. Rushby, and D. Stringer-Calvert. PVS prover guide, 1999. Version 2.3.
14. Hendrik Tews. Coalgebraic Methods for Object Oriented Specification. PhD thesis, Technical University of Dresden, October 2002.
15. F. J. Thayer, J. C. Herzog, and J. D. Guttman. Strand spaces: Proving security protocols correct. Journal of Computer Security, 7(1), 1999.