Abstract
We investigate extensions of the Dolev-Yao model of a passive intruder into a cryptographic protocol by some algebraic properties of cryptographic primitives. We provide sufficient conditions under which the intruder deduction problem is decidable in polynomial time. We apply this result to the equational theory of homomorphism, and show that in this case the intruder deduction problem is linear, provided that the messages are in normal form. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Comon-Lundh, H., & Treinen, R. (2004). Easy intruder deductions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2772, 225–242. https://doi.org/10.1007/978-3-540-39910-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
