Intruders with Caps

DOI10.1007/978-3-540-73449-9_4MaRDI QIDQ5432331zbMATH OpenOpenAlexFDO

Authors Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch

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)

Recommendations

• Finding intruder knowledge with cap-matching
• Caps and Robbers: What Can You Expect?
• scientific article; zbMATH DE number 3572179
• A new construction of caps
• Capturing an Intruder in the Pyramid
• Cops, robber and traps
• Caps with free pairs of points

Cited in

(12)

• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Computing knowledge in security protocols under convergent equational theories
• Unification modulo homomorphic encryption
• YAPA: A Generic Tool for Computing Intruder Knowledge
• Unification modulo homomorphic encryption
• Key Substitution in the Symbolic Analysis of Cryptographic Protocols
• Compiling and securing cryptographic protocols
• Challenges in the Automated Verification of Security Protocols
• Automated verification of equivalence properties of cryptographic protocols
• Knowledge problems in protocol analysis: extending the notion of subterm convergent
• Foundations of Software Science and Computation Structures
• Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols

This page was built for publication: Intruders with Caps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432331)