BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme
Pyrros Chaidos, Véronique Cortier, Georg Fuchsbauer, 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference StringsMary Maller, Sean Bowe, Markulf Kohlweiss, Sarah MeiklejohnCCS 2019 · 412 citations
- Voting: You Can't Have Privacy without Individual VerifiabilityVéronique Cortier, Joseph LallemandCCS 2018 · 36 citations
- Did you mix me? Formally Verifying Verifiable Mix Nets in Electronic VotingThomas Haines, Rajeev Goré, Bhavesh SharmaS&P 2021 · 14 citations
- New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai ProofsGottfried Herold, Max Hoffmann, Michael Klooß, Carla Ràfols et al.CCS 2017 · 12 citations
- Can we cast a ballot as intended and be receipt free?Henri Devillez, Olivier Pereira, Thomas Peters, Quentin YangS&P 2024 · 4 citations
Related papers
- Machine-Checked Proofs of Privacy for Electronic Voting ProtocolsVéronique Cortier, Constantin Catalin Dragan, François Dupressoir, Benedikt Schmidt et al.S&P 2017 · 50 citations
- Election Eligibility with OpenID: Turning Authentication into Transferable Proof of EligibilityVéronique Cortier, Alexandre Debant, Anselme Goetschmann, Lucca HirschiUSENIX Security 2024 · 2 citations
- A Type System for Privacy PropertiesVéronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo MaffeiCCS 2017 · 34 citations
- Verifying Table-Based ElectionsDavid A. Basin, Jannik Dreier, Sofia Giampietro, Sasa RadomirovicCCS 2021
- VoteAgain: A scalable coercion-resistant voting systemWouter Lueks, Iñigo Querejeta-Azurmendi, Carmela TroncosoUSENIX Security 2020
