Skip to Main content Skip to Navigation

Ballot secrecy and ballot independence: definitions and relations

Abstract : 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 prove that it is sufficient for ballot independence. We also prove that non-malleable ballots are sufficient for ballot independence. Thirdly, we prove that ballot independence is sufficient for ballot secrecy in a special case. Our results show that ballot independence is necessary in election schemes satisfying ballot secrecy. Furthermore, our sufficient conditions enable simpler proofs of ballot secrecy.
Document type :
Complete list of metadata
Contributor : Bruno Blanchet Connect in order to contact the contributor
Submitted on : Monday, January 12, 2015 - 3:05:02 PM
Last modification on : Friday, January 21, 2022 - 3:13:42 AM


  • HAL Id : hal-01102313, version 1



Ben Smyth, David Bernhard. Ballot secrecy and ballot independence: definitions and relations. [Research Report] 2013/235, Cryptology ePrint Archive. 2013, pp.24. ⟨hal-01102313⟩



Record views