Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Blanchet, Brunoa | Smyth, Benb; *
Affiliations: [a] Inria, Paris, France. E-mail: Bruno.Blanchet@inria.fr | [b] Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg. E-mail: research@bensmyth.com
Correspondence: [*] Corresponding author. E-mail: research@bensmyth.com.
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, Lee et al., and Juels, Catalano & Jakobsson, and in the vehicular ad-hoc network by Freudiger et al.
Keywords: Applied pi calculus, automated reasoning, ballot secrecy, barrier synchronisation, equivalence, e-voting, privacy, receipt-freeness
DOI: 10.3233/JCS-171013
Journal: Journal of Computer Security, vol. 26, no. 3, pp. 367-422, 2018
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl