Abstract
This paper shows how to derive a representation of the participants’ knowledge in a cryptographic protocol. The modelization is based on the assumption that the underlying cryptographic system is perfect and is an extension of the “Hidden Automorphism Model” introduced by Merritt. It can be used to establish the security of the protocols.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Toussaint, M. J. (1992). Deriving the complete knowledge of participants in cryptographic protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 576 LNCS, pp. 24–43). Springer Verlag. https://doi.org/10.1007/3-540-46766-1_2
Readers over time
Readers' Seniority
Readers' Discipline
