Cryptology ePrint Archive: Report 2015/629

BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme

Pyrros Chaidos and Véronique Cortier and Georg Fuchsbauer and David Galindo

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.

Category / Keywords: cryptographic protocols / e-voting, receipt-freeness

Original Publication (with minor differences): ACM CCS 2016

Date: received 24 Jun 2015, last revised 13 Oct 2016

Contact author: fuchsbau at di ens fr

Available format(s): PDF | BibTeX Citation

Note: Major revision; main differences: -- new SRC construction, now w/o random oracles -- implementation, providing benchmarks

Version: 20161013:092001 (All versions of this report)

Short URL: ia.cr/2015/629