Abstract
We give a general introduction to cryptographic protocols and the kinds of attacks to which they are susceptible. We then present a framework based on linear logic programming for analyzing authenti- cation protocols and show how various notions of attack are expressed in this framework. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
APA
Compton, K. J., & Dexter, S. (1999). Proof techniques for cryptographic protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1644 LNCS, pp. 25–39). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free