Models for an adversary-centric protocol logic

Electronic Notes in Theoretical Computer Science

Volumn 55, Issue 1, 2003, Pages 69-84

  Selinger, Peter ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CRIME; ENCODING (SYMBOLS); FORMAL LOGIC; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOL; FIRST-ORDER LOGIC; LOGICAL ENCODING; PROTOCOL REQUIREMENTS;

CRYPTOGRAPHY;

EID: 19144364839     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00245-2     Document Type: Conference Paper

References (5)

1. Burrows M., Abadi M., Needham R. A logic of authentication. ACM Transactions on Computer Systems. 8:(1):1990;18-36
2. I. Cervesato, N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov. A metanotation for protocol analysis. In R. Gorrieri, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop, CSFW'99. IEEE Computer Society Press, 1999.
3. K. J. Compton and S. Dexter. Proof techniques for cryptographic protocols. In Proceedings of ICALP'99, pages 25-39. 1999.
4. Dolev D., Yao A. On the security of public-key protocols. IEEE Transactions on Information Theory. 2:(29):1983
5. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using CSP and FDR. In 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, 1996.