Key compromise, strand spaces, and the authentication tests

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 141-161

  Guttman, Joshua D ^a  

^a MITRE CORPORATION   (United States)

Author keywords

Authentication; Authentication tests; Bundles; Cryptographic protocols; Key compromise; Strand spaces

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; NETWORK PROTOCOLS; SECURITY OF DATA;

AUTHENTICATION; AUTHENTICATION TESTS; BUNDLES; CRYPTOGRAPHIC PROTOCOLS; KEY COMPROMISE; STRAND TESTS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 18944391675     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80960-5     Document Type: Conference Paper

References (23)

1. Burrows M., M. Abadi and R. Needham, A logic of authentication, Proceedings of the Royal Society Series A, 426 (1989), pp. 233-271
2. also appeared as SRC Research Report 39
3. in a shortened form, in ACM Transactions on Computer Systems 8, 1 (February 1990), 18-36.
4. Denning D., Sacco G. Timestamps in key distribution protocols. Communications of the ACM. 24:1981
5. Dolev D., Yao A. On the security of public-key protocols. IEEE Transactions on Information Theory. 29:1983;198-208
6. Guttman J.D. Security goals: Packet trajectories and strand spaces. Gorrieri R., Focardi R. Foundations of Security Analysis and Design. LNCS 2171 :2001;Springer Verlag. Forthcoming
7. Guttman, J. D. and F. J. Thayer Fábrega, Authentication tests, in: Proceedings, 2000 IEEE Symposium on Security and Privacy, May (2000).
8. Guttman, J. D. and F. J. Thayer Fábrega, Protocol independence through disjoint encryption, in: Proceedings, 13th Computer Security Foundations Workshop (2000).
9. Guttman, J. D. and F. J. Thayer Fábrega, Authentication tests and the structure of bundles, Theoretical Computer Science (2001), to appear.
10. Heather J. and S. Schneider, Toward automatic verification of authentication protocols on an unbounded network, in: Proceedings, 13th Computer Security Foundations Workshop (2000).
11. Lowe G., Breaking and fixing the Needham-Schroeder public-key protocol using FDR, in: Proceedings of TACAS, Lecture Notes in Computer Science 1055 (1996), pp. 147-166.
12. Lowe G., Casper: A compiler for the analysis of security protocols, in: 10th Computer Security Foundations Workshop Proceedings (1997), pp. 18-30.
13. Lowe G., A hierarchy of authentication specifications, in: 10th Computer Security Foundations Workshop Proceedings (1997), pp. 31-43.
14. Marrero W., E. Clarke and S. Jha, A model checker for authentication protocols, in: C. Meadows and H. Orman, editors, Proceedings of the DIMACS Workshop on Design and Verification of Security Protocols, DIMACS, Rutgers University, 1997.
15. Needham R., Schroeder M. Using encryption for authentication in large networks of computers. Communications of the ACM. 21:1978
16. Otway D., Rees O. Efficient and timely mutual authentication. Operating Systems Review. 21:1987;8-10
17. Paulson, L. C., The inductive approach to verifying cryptographic protocols, Journal of Computer Security (1998), also Report 443, Cambridge University Computer Lab.
18. Paulson, L. C., Relations between secrets: Two formal analyses of the Yahalom protocol, Journal of Computer Security (2001)
19. also available as Cambridge University Computer Laboratory Technical Report 432 (1997).
20. Perrig A. and D. X. Song, Looking for diamonds in the desert: Extending automatic protocol generation to three-party authentication and key agreement protocols, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop (2000).
21. Schneider S., Verifying authentication protocols with CSP, in: Proceedings of the 10th IEEE Computer Security Foundations Workshop (1997), pp. 3-17.
22. Fábrega Thayer F.J., Herzog J.C., Guttman J.D. Strand spaces: Proving security protocols correct. Journal of Computer Security. 7:1999;191-230
23. Woo, T. Y. C. and S. S. Lam, Verifying authentication protocols: Methodology and example, in: Proc. Int. Conference on Network Protocols, 1993.