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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Authors

Colleges, School and Institutes

External organisations

  • Inria
  • University College London

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.

Details

Original languageEnglish
Title of host publication 23rd ACM Conference on Computer and Communications Security
Subtitle of host publicationACM CCS 2016
Publication statusPublished - 24 Oct 2016
EventACM CCS 2016: 23rd ACM Conference on Computer and Communications Security - Vienna, Austria
Duration: 24 Oct 201628 Oct 2016
https://www.sigsac.org/ccs/CCS2016/

Conference

ConferenceACM CCS 2016
CountryAustria
CityVienna
Period24/10/1628/10/16
Internet address