A bound on attacks on authentication protocols

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 588-600

  Stoller, Scott D ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION;

AUTHENTICATION PROTOCOLS; CONCURRENT EXECUTION; NEEDHAM-SCHROEDER; PROTOCOL EXECUTION;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 84891081669     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_48     Document Type: Article

References (14)

1. Michael Burrows, Martin Abadi, and Roger Needham. A logic of authentication. ACM Transactions on Computer Systems, 8(l):18-36, February 1990.
2. Iliano Cervesato, Nancy Durgin, Patrick Lincoln, John Mitchell, and Andre Sce-drov. Relating strands and multiset rewriting for security protocol analysis. In Paul Syverson, editor, Proc. 13th IEEE Computer Security Foundations Workshop, pages 35-51. IEEE Press, 2000.
3. Edmund M. Clarke, Orna Grumberg, and Somesh Jha. Verifying parameterized networks using abstractions and regular languages. In Proc. Sixth Int'l. Conference on Concurrency Theory (CONCUR), 1995.
4. James Heather and Steve Schneider. Towards automatic verification of authentication protocols on an unbounded network. In Proc. 13th IEEE Computer Security Foundations Workshop (CSFW), July 2000.
5. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-564, 1978.
6. Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Proc. Workshop on Tools and Algorithms for The Construction and Analysis of Systems (TACAS), volume 1055 of Lecture Notes in Computer Science, pages 147-166. Springer, 1996.
7. Gavin Lowe. Towards a completeness result for model checking of security protocols. The Journal of Computer Security, 7(2/3):89-146, 1999.
8. Dave Otway and Owen Rees. Efficient and timely mutual authentication. Operating Systems Review, 21(1):8-10, January 1987.
9. L. C. Paulson. The inductive approach to verifying cryptographic protocols. The Journal of Computer Security, 6(l/2):85-128, 1996.
10. A. W. Roscoe and P. J. Broadfoot. Proving security protocols with model checkers by data independence techniques. The Journal of Computer Security, 7(2/3), 1999.
11. Scott D. Stoller. A bound on attacks on authentication protocols. Technical Report 526, Computer Science Dept., Indiana University, July 1999. Revised April 2001. Also available at www.cs.sunysb.edu/~stoller/TR526.html.
12. Scott D. Stoller. A bound on attacks on payment protocols. In Proc. 16th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 61-70. IEEE Press, June 2001.
13. F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: proving security protocols correct. The Journal of Computer Security, 7:191-230, 1999.
14. Thomas Woo and Simon S. Lam. A semantic model for authentication protocols. In Proc. 14th IEEE Symposium on Research in Security and Privacy, pages 178-194. IEEE Press, 1993.