Ballot secrecy and ballot independence coincide - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Ballot secrecy and ballot independence coincide


We study ballot independence for election schemes. First, we formally define ballot independence as a cryptographic game and prove that ballot secrecy implies ballot independence. Secondly, we introduce a notion of controlled malleability and show that it is sufficient for ballot independence. We also show that non-malleable ballots are sufficient, but not necessary, for ballot independence. Thirdly, we prove that ballot independence is sufficient for ballot secrecy under practical assumptions. Our results show that ballot independence is necessary in election schemes satisfying ballot secrecy. Furthermore, our sufficient conditions will enable simpler proofs of ballot secrecy.
No file

Dates and versions

hal-00863370 , version 1 (18-09-2013)


  • HAL Id : hal-00863370 , version 1


Ben Smyth, David Bernhard. Ballot secrecy and ballot independence coincide. ESORICS'13: 18th European Symposium on Research in Computer Security, 2013, Egham, United Kingdom. pp.463-480. ⟨hal-00863370⟩


136 View
0 Download


Gmail Facebook X LinkedIn More