Dery et al. recently proposed a secure voting protocol for score-based elections, where independent talliers perform the tallying procedure. The protocol offers perfect ballot secrecy: it outputs the identity of the winner(s), but keeps all other information secret, even from the talliers. This high level of privacy, which may encourage voters to vote truthfully, and the protocol's extremely lightweight nature, make it a most adequate and powerful tool for democracies of any size. We have implemented that system and in this work we describe the system's components - election administrators, voters and talliers - and its operation. Our implementation is in Python and is open source. We view this demo as an essential step towards convincing decision makers in communities that practice score-based elections to adopt it as their election platform.
|Title of host publication||CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security|
|Publisher||Association for Computing Machinery|
|Number of pages||3|
|State||Published - 12 Nov 2021|
|Event||27th ACM Annual Conference on Computer and Communication Security, CCS 2021 - Virtual, Online, Korea, Republic of|
Duration: 15 Nov 2021 → 19 Nov 2021
|Name||Proceedings of the ACM Conference on Computer and Communications Security|
|Conference||27th ACM Annual Conference on Computer and Communication Security, CCS 2021|
|Country/Territory||Korea, Republic of|
|Period||15/11/21 → 19/11/21|
Bibliographical noteFunding Information:
Lihi Dery’s work was supported by the Ariel Cyber Innovation Center in conjunction with the Israel National Cyber Directorate in the Prime Minister’s Office.
© 2021 Owner/Author.
- computational social choice
- electronic voting
- perfect ballot secrecy
- secure multiparty computation
- voting protocols