Towards Verifying Voter Privacy Through Unlinkability

Abstract : The increasing official use of security protocols for electronic voting deepens the need for their trustworthiness, hence for their formal verification. The impossibility of linking a voter to her vote, often called voter privacy or ballot secrecy, is the core property of many such protocols. Most existing work relies on equivalence statements in cryptographic extensions of process calculi. This paper provides the first theorem-proving based verification of voter privacy and overcomes some of the limitations inherent to process calculi-based analysis. Unlinkability between two pieces of information is specified as an extension to the Inductive Method for security protocol verification in Isabelle/HOL. New message operators for association extraction and synthesis are defined. Proving voter privacy demanded substantial effort and provided novel insights into both electronic voting protocols themselves and the analysed security goals. The central proof elements are described and shown to be reusable for different protocols with minimal interaction.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-00766201
Contributor : Denis Butin <>
Submitted on : Friday, March 8, 2013 - 7:23:12 PM
Last modification on : Thursday, February 7, 2019 - 5:54:48 PM
Long-term archiving on : Sunday, June 9, 2013 - 4:10:18 AM

File

cameraready.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Denis Butin, David Gray, Giampaolo Bella. Towards Verifying Voter Privacy Through Unlinkability. ESSoS13 - International Symposium on Engineering Secure Software and Systems, Feb 2013, Rocquencourt, France. pp.91-106, ⟨10.1007/978-3-642-36563-8_7⟩. ⟨hal-00766201⟩

Share

Metrics

Record views

353

Files downloads

319