Using a PVS embedding of CSP to verify authentication protocols

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

Volumn 1275, Issue , 1997, Pages 121-136

  Dutertre, Bruno ^a   Schneider, Steve ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; EMBEDDINGS; FORMAL LOGIC; NETWORK SECURITY; SEMANTICS;

AUTHENTICATION PROTOCOLS; MECHANICAL SUPPORT; NEEDHAM-SCHROEDER; PROOF RULES; PUBLIC-KEY PROTOCOL; SECURITY PROTOCOLS; SEMANTIC EMBEDDING; VERIFICATION METHOD;

THEOREM PROVING;

EID: 84949641590     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028390     Document Type: Conference Paper

References (17)

1. S. H. Brackin. Deciding Cryptographic Protocol Adequacy with HOL: The Implementation. In TPHOLs’96. Springer-Verlag, LNCS 1125, 1996.
2. J. Bryans and S. Schneider. Mechanical Verification of the full Needham-Schroeder public key protocol. Technical report, Royal HoEoway, University of London, 1997.
3. M. Burrows, M. Abadi, and R. Needham. A Logic of Authentication. Technical Report 39, Digital Equipment Corporation, System Research Center, 1989.
4. A. J. Camilleri. Mechanizing CSP trace theory in higher order logic. IEEE Transactions on Software Engineering, 16(9):993-1004, 1990.
5. J. Crow, S. Owre, J. Rushby, N. Shankar, and M. Srivas. A tutorial introduction to PVS. In Workshop on Industrial-Strength Formal Specification Techniques, 1995.
6. B. Dutertre and S. Schneider. Embedding CSP in PVS. An AppEcation to Authentication Protocols. Technical report, Royal Holoway, CSD-TR-97-12.
7. C. A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.
8. R. Kemmerer, C. Meadows, and Millen I. Three systems for cryptographic analysis. Journal of Cryptology, 7(2), 1994.
9. G. Lowe. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In Proc. of TACAS’96. Springer-Verlag, LNCS 1055, 1996.
10. R. M. Needham and M. D. Schroeder. Using Encryption for Authentication in Large Networks of Computers. Comm, of the ACM, 21(12):993-999, 1978.
11. S. Owre, N. Shankar, and J. M. Rushby. The PVS Specification Language. Computer Science Lab., SRI International, 1993.
12. L. Paulson. Proving Properties of Security Protocols by Induction. Technical Report TR409, Computer Laboratory, University of Cambridge, 1996.
13. S. Schneider. Security Properties and CSP. In IEEE Symposium on Security and Privacy, 1996.
14. S. Schneider. Using CSP for protocol analysis: the Needham-Schroeder Public Key Protocol. Technical Report CSD-TR-96-14, Royal HoEoway, 1996.
15. J. U. Skakkebaek and N. Shankar. Towards a duration calculus proof assistant in PVS. In Formal Techniques in Real-Time and Fault-Tolerant Systems. Springer-Verlag, LNCS 863, September 1994.
16. P. Syverson and P. van Oorschot. On Unifying Some Cryptographic Protocol Logics. In Proc. of the 1994 IEEE Symp. on Research in Security and Privacy, 1994.
17. F. J. Thayer. An approach to process algebra using IMPS. Technical Report MP-94B193, The MITRE Corporation, 1994.