Skip to Main content Skip to Navigation
Conference papers

Automated Reasoning for Equivalences in the Applied Pi Calculus with Barriers

Abstract : Observational equivalence allows us to study important security properties such as anonymity. Unfortunately, the difficulty of proving observational equivalence hinders analysis. Blanchet, Abadi & Fournet simplify its proof by introducing a sufficient condition for observational equivalence , called diff-equivalence, which is a reachability condition that can be proved automatically by ProVerif. However, diff-equivalence is a very strong condition, which often does not hold even if observational equivalence does. In particular, when proving equivalence between processes that contain several parallel components, e.g., P | Q and P | Q , diff-equivalence requires that P is equivalent to P and Q is equivalent to Q. To relax this constraint, Delaune, Ryan & Smyth introduced the idea of swapping data between parallel processes P and Q at synchronisation points, without proving its soundness. We extend their work by formalising the semantics of synchronisation, formalising the definition of swapping, and proving its soundness. We also relax some restrictions they had on the processes to which swapping can be applied. Moreover, we have implemented our results in ProVerif. Hence, we extend the class of equivalences that can be proved automatically. We showcase our results by analysing privacy in election schemes by Fujioka, Okamoto & Ohta and Lee et al., and in the vehicular ad-hoc network by Freudiger et al.
Complete list of metadata
Contributor : Bruno Blanchet Connect in order to contact the contributor
Submitted on : Saturday, December 31, 2016 - 12:57:53 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:04 PM
Long-term archiving on: : Saturday, April 1, 2017 - 12:04:13 PM


Files produced by the author(s)




  • is version of hal-01947972 - hal-01423742 is the conference version, hal-01947972 is the journal version


Bruno Blanchet, Ben Smyth. Automated Reasoning for Equivalences in the Applied Pi Calculus with Barriers. 29th IEEE Computer Security Foundations Symposium (CSF'16), Jun 2016, Lisboa, Portugal. pp.310 - 324, ⟨10.1109/CSF.2016.29⟩. ⟨hal-01423742⟩



Record views


Files downloads