Deciding Key Cycles for Security Protocols
From MaRDI portal
Publication:5387901
DOI10.1007/11916277_22zbMath1165.94319OpenAlexW1543072317MaRDI 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
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Verifying Cryptographic Protocols with Subterms Constraints ⋮ 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 ⋮ Bounding Messages for Free in Security Protocols ⋮ Safely composing security protocols
Uses Software
