Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR

David Baelde 1 Stéphanie Delaune 2 Ivan Gazeau 3 Steve Kremer 4
3 PESTO - Proof techniques for security protocols
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
4 SECSI - Security of information systems
LSV - Laboratoire Spécification et Vérification [Cachan], ENS Cachan - École normale supérieure - Cachan, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8643
Abstract : In symbolic verification of security protocols, process equivalences have recently been used extensively to model strong secrecy, anonymity and unlinkability properties. However, tool support for automated analysis of equivalence properties is limited compared to trace properties, e.g., modeling authentication and weak notions of secrecy. In this paper, we present a novel procedure for verifying equivalences on finite processes, i.e., without replication, for protocols that rely on various cryptographic primitives including exclusive or (xor). We have implemented our procedure in the tool AKISS, and successfully used it on several case studies that are outside the scope of existing tools, e.g., unlinkability on various RFID protocols, and resistance against guessing attacks on protocols that use xor.
Document type :
Conference papers
Complete list of metadatas
Contributor : Stéphanie Delaune <>
Submitted on : Saturday, October 27, 2018 - 11:14:55 AM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

Links full text



David Baelde, Stéphanie Delaune, Ivan Gazeau, Steve Kremer. Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR. CSF 2017 - 30th IEEE Computer Security Foundations Symposium, Aug 2017, Santa Barbara, United States. ⟨10.1109/CSF.2017.22⟩. ⟨hal-01906644⟩



Record views