Decidability of equivalence of symbolic derivations

DOI10.1007/S10817-010-9199-5zbMath1242.68097OpenAlexW1965890562MaRDI QIDQ437031

Michaël Rusinowitch, Yannick Chevalier

Publication date: 17 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-010-9199-5

zbMATH Keywords

observational equivalenceDolev-Yao modelsecurity protocolsubterm deduction systemsymbolic derivation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items (8)

From Security Protocols to Pushdown Automata ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ Deciding equivalence-based properties using constraint solving ⋮ Unnamed Item ⋮ A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols ⋮ A procedure for deciding symbolic equivalence between sets of constraint systems ⋮ Automating Security Analysis: Symbolic Equivalence of Constraint Systems ⋮ Automated Verification of Equivalence Properties of Cryptographic Protocols

Cites Work

• Unnamed Item
• Compiling and securing cryptographic protocols
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Automated verification of selected equivalences for security protocols
• Proof Techniques for Cryptographic Processes
• Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
• Mobile values, new names, and secure communication
• Automata, Languages and Programming
• Automating Security Analysis: Symbolic Equivalence of Constraint Systems

This page was built for publication: Decidability of equivalence of symbolic derivations