Paper 2013/235 Original: eprint.iacr.org/2013/235 ↗
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2014-10-10: last updated
- 2013-04-29: published
- Short URL
- https://ia.cr/2013/235
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/235,
author = {Ben Smyth and David Bernhard},
title = {Ballot secrecy and ballot independence: definitions and relations},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/235},
year = {2013},
url = {https://eprint.iacr.org/2013/235}
}