Abstract
We propose a new voting scheme, BeleniosRF, that offers both receipt-freeness and end-to-end verifiability. It is receipt-free in a strong sense, meaning that even dishonest voters cannot prove how they voted. We provide a game-based definition of receipt-freeness for voting protocols with non-interactive ballot casting, which we name strong receipt-freeness (sRF). To our knowledge, sRF is the first game-based definition of receipt-freeness in the literature, and it has the merit of being particularly concise and simple. Built upon the Helios protocol, BeleniosRF inherits its simplicity and does not require any anti-coercion strategy from the voters. We implement BeleniosRF and show its feasibility on a number of platforms, including desktop computers and smartphones.
Original language | English |
---|---|
Title of host publication | CCS’16 |
Subtitle of host publication | Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security |
Publisher | Association for Computing Machinery |
Pages | 1614-1625 |
ISBN (Print) | 9781450341394 |
DOIs | |
Publication status | Published - 24 Oct 2016 |
Event | CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security - Vienna, Austria Duration: 24 Oct 2016 → 28 Oct 2016 Conference number: 23rd https://www.sigsac.org/ccs/CCS2016/ |
Conference
Conference | CCS'16 |
---|---|
Country/Territory | Austria |
City | Vienna |
Period | 24/10/16 → 28/10/16 |
Internet address |