Deciding security properties for cryptographic protocols. application to key cycles
From MaRDI portal
Publication:2946596
DOI10.1145/1656242.1656244zbMath1351.94035arXiv0708.3564OpenAlexW2155993098WikidataQ130960630 ScholiaQ130960630MaRDI QIDQ2946596
Véronique Cortier, Hubert Comon-Lundh, Eugen Zălinescu
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.3564
Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
Related Items (8)
SPEC: An Equivalence Checker for Security Protocols ⋮ Modeling and verifying ad hoc routing protocols ⋮ Deducibility constraints and blind signatures ⋮ Intruder deducibility constraints with negation. Decidability and application to secured service compositions ⋮ A procedure for deciding symbolic equivalence between sets of constraint systems ⋮ Automating Security Analysis: Symbolic Equivalence of Constraint Systems ⋮ Deciding Security for Protocols with Recursive Tests ⋮ Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
This page was built for publication: Deciding security properties for cryptographic protocols. application to key cycles
