A decision procedure for the existence of a rank function

Journal of Computer Security

Volumn 13, Issue 2, 2005, Pages 317-344

  Heather, James ^a   Schneider, Steve ^a  

^a UNIVERSITY OF SURREY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SYSTEMS; CRYPTOGRAPHY; DECISION MAKING; FORMAL LOGIC; FUNCTIONS; NETWORK PROTOCOLS; SECURITY OF DATA; USER INTERFACES;

BAN LOGICS; COMMUNICATING SEQUENTIAL PROCESS (CSP); RANK FUNCTIONS; SECURITY PROTOCOLS;

COMPUTER OPERATING PROCEDURES;

EID: 14844344837     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2005-13204     Document Type: Review

References (23)

1. M. Burrows, M. Abadi and R.M. Needham, A logic of authentication, Technical Report 39, SRC DIGITAL, 1989.
2. I. Cervesato, N.A. Durgin, P.D. Lincoln, J.C. Mitchell and A. Scedrov, A meta-notation for Protocol Analysis, in: Proceedings of 12th IEEE Computer Security Foundations Workshop, 1999, pp. 55-69.
3. D. Dolev and A.C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory 29(2) (1983).
4. 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), The 1999 Federated Logic Conference (FLoC '99), 1999.
5. J.A. Heather, "Oh! ...Is it really you ?" - Using Rank Functions to Verify Authentication Protocols, Department of Computer Science, Royal Holloway, University of London, December 2000.
6. J.A. Heather, G. Lowe and S.A. Schneider, How to avoid type flaw attacks on security protocols, in: Proceedings of 13th IEEE Computer Security Foundations Workshop, 2000.
7. J.A. Heather and S.A. Schneider, Towards automatic verification of authentication protocols on an unbounded network, in: Proceedings of 13th IEEE Computer Security Foundations Workshop, 2000.
8. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International, 1985.
9. R.A. Kemmerer, C.A. Meadows and J.K. Millen, Three systems for cryptographic protocol analysis, Journal of Cryptology 7(2) (1994).
10. G. Lowe, An attack on the Needham-Schroeder public key protocol, Information Processing Letters 56 (1995), 131-133.
11. C.A. Meadows, Applying formal methods to the analysis of a key management protocol, Journal of Computer Security 1(1) (1992).
12. J.K. Millen, The interrogator model, in: Symposium on Research in Security and Privacy, IEEE Computer Society, 1995.
13. J.K. Millen, A necessarily parallel attack, in: Proceedings of the Workshop on Formal Methods and Security Protocols, Trento, Italy, 1999.
14. R.M. Needham and M.D. Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM 21(12) (1978), 993-999.
15. L.C. Paulson, Proving properties of security protocols by induction, in: Proceedings of 10th IEEE Computer Security Foundations Workshop, 1997.
16. A.W. Roscoe, The Theory and Practice of Concurrency, Prentice-Hall International, 1998.
17. P. Ryan, S. Schneider, M. Goldsmith, G. Lowe and B. Roscoe, The Modelling And Analysis Of Security Protocols, Addison-Wesley, 2000.
18. P.Y.A. Ryan, Personal communication.
19. S.A. Schneider, Verifying authentication protocols in CSP, IEEE TSE 24(9) (1998).
20. S.A. Schneider, Concurrent and Real-time Systems: The CSP Approach, Wiley, 1999.
21. D.X. Song, Athena: a new efficient checker for security protocol analysis, in: Proceedings of 12th IEEE Computer Security Foundations Workshop, 1999.
22. F. Javier Thayer Fábrega, J.C. Herzog and J.D. Guttman, Strand spaces: proving security protocols correct, Journal of Computer Security 7 (1999), 191-230.
23. T.Y.C. Woo and S.S. Lam, A semantic model for authentication protocols, in: Proceedings of the 14th IEEE Symposium on Research in Security and Privacy, 1993, pp. 178-194.