Deciding Key Cycles for Security Protocols
From MaRDI portal
Publication:5387901
DOI10.1007/11916277_22zbMath1165.94319MaRDI QIDQ5387901
Eugen Zălinescu, Véronique Cortier
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11916277_22
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Safely Composing Security Protocols, Bounding Messages for Free in Security Protocols, Bounding messages for free in security protocols -- extension to various security properties, A survey of symbolic methods in computational analysis of cryptographic systems, Safely composing security protocols, Verifying Cryptographic Protocols with Subterms Constraints
Uses Software