Abstract
We introduce an original method to verify probabilistic properties in cryptographic protocols. This method uses the representation of participants' knowledge that we presented at CRYPTO'91. 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.
Cite
CITATION STYLE
Toussaint, M. J. (1993). Formal verification of probabilistic properties in cryptographic protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 739 LNCS, pp. 412–426). Springer Verlag. https://doi.org/10.1007/3-540-57332-1_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
