Intruders with Caps

DOI10.1007/978-3-540-73449-9_4zbMath1203.94091OpenAlexW1557437480MaRDI QIDQ5432331

Paliath Narendran, Michaël Rusinowitch, Siva Anantharaman

Publication date: 2 January 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (10)

Computing knowledge in security protocols under convergent equational theories ⋮ Unification modulo homomorphic encryption ⋮ Challenges in the Automated Verification of Security Protocols ⋮ Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols ⋮ Computing Knowledge in Security Protocols under Convergent Equational Theories ⋮ Compiling and securing cryptographic protocols ⋮ Key Substitution in the Symbolic Analysis of Cryptographic Protocols ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols ⋮ YAPA: A Generic Tool for Computing Intruder Knowledge ⋮ Unification Modulo Homomorphic Encryption

This page was built for publication: Intruders with Caps