A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR
2017
2017 IEEE 30th Computer Security Foundations Symposium (CSF)
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
doi:10.1109/csf.2017.22
dblp:conf/csfw/BaeldeDGK17
fatcat:k5jcblv44fextdcvic3xj6mwdq