A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
From MaRDI portal
Publication:511946
DOI10.1016/j.jlamp.2016.10.005zbMath1359.68023arXiv1610.08279OpenAlexW2951996797MaRDI QIDQ511946
Stéphanie Delaune, Lucca Hirschi
Publication date: 22 February 2017
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08279
Related Items (3)
POR for security protocol equivalences. Beyond action-determinism ⋮ One vote is enough for analysing privacy ⋮ A decidable class of security protocols for both reachability and equivalence properties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding equivalence-based properties using constraint solving
- Decidability of equivalence of symbolic derivations
- Computing knowledge in security protocols under convergent equational theories
- Decidability and combination results for two notions of knowledge in security protocols
- A survey of symbolic methods in computational analysis of cryptographic systems
- A calculus for cryptographic protocols: The spi calculus
- Automated verification of selected equivalences for security protocols
- Proof Techniques for Cryptographic Processes
- Receipt-free secret-ballot elections (extended abstract)
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity
- Towards Unconditional Soundness: Computationally Complete Symbolic Attacker
- Security Protocols, Constraint Systems, and Group Theories
- Simulation based security in the applied pi calculus
- YAPA
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Folding Variant Narrowing and Optimal Variant Termination
- CSP and anonymity
- A Complete Symbolic Bisimilarity for an Extended Spi Calculus
- Mobile values, new names, and secure communication
- Barbed bisimulation
- From Security Protocols to Pushdown Automata
- Automated Verification of Equivalence Properties of Cryptographic Protocols
- Programming Languages and Systems
- Practical Everlasting Privacy
- Proving More Observational Equivalences with ProVerif
- Formal Verification of e-Auction Protocols
- From Security Protocols to Pushdown Automata
- LALBLC A Program Testing the Equivalence of dpda’s
- Partial Order Reduction for Security Protocols
- Probabilistic relational verification for cryptographic implementations
- Automata, Languages and Programming
- Term Rewriting and Applications
- Automating Security Analysis: Symbolic Equivalence of Constraint Systems
This page was built for publication: A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
