Verifiable and Receipt-Free Electronic Voting Protocols

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 226 papers47 conceptsfrozen 2026-10-04

In a traditional paper-based election, the "curtain" of the voting booth provides a physical guarantee of privacy. You walk in alone, mark a ballot, and drop it into a box. However, this system relies on trusting the people who count the boxes. Electronic voting aims to replace this human trust with mathematical certainty through universal verifiability—the ability for anyone to audit the election and prove the tally is correct.

Yet, this transparency creates a paradox. If a system provides enough information for a voter to verify that their specific ballot was counted correctly, it often provides enough information for that voter to prove their choice to a third party. This "receipt" enables vote-buying and coercion, undermining the very democracy the system was meant to protect.

The Transparency Paradox

The fundamental challenge in electronic voting is balancing two conflicting requirements: accountability and anonymity. Lifeng Yuan, Mingchu Li, and colleagues describe this as a fundamental tension where the audit trail needed to penalize malicious actors can inadvertently expose how individuals voted.

Deshinta Arrova Dewi and her team visualize this as a trade-off space. In their "Balance Graph," they note that high levels of system verifiability do not automatically guarantee privacy. If the tallying mechanism is too transparent, it may allow for "probabilistic identification," where an observer can guess a voter's choice with high certainty based on the public ledger.

Decoupling Identity from the Ballot

To solve this, researchers use cryptographic primitives to break the link between the person and the vote. One common approach is the use of blind signatures. As explored by Qi Wang and Yi Liu, this involves an authority signing a "blinded" ballot without seeing its contents. The voter then unblinds the signature and submits the ballot anonymously. This ensures that while the system can verify the voter was eligible, it cannot link the identity to the submission.

Another mechanism is the mix network, described by Tianbo Lu and others as a cryptographic "laundry". Mix-nets shuffle and re-encrypt messages across multiple servers, making it impossible to trace a specific output back to a specific input unless all servers in the chain collude.

The Receipt Problem and Coercion Resistance

Even if the system is anonymous, it may not be receipt-free. In many digital protocols, the voter possesses the cryptographic randomness or "blinding factors" used to create their ballot. Haotian Jing and Bowen Xu point out that if a voter retains these factors, they can voluntarily reveal them to a third party to prove how they voted. This is the "receipt problem."

True coercion resistance goes a step further: it ensures that even if a voter is forced to reveal all their secret keys and randomness, they can still provide a "fake" proof that looks real to the coercer but does not reflect their actual vote. Moni Naor and Tal Moran pioneered protocols that achieve everlasting privacy, ensuring that even if cryptographic assumptions are broken in the future, the link between voter and ballot remains hidden.

Strategies for Thwarting Coercion

Recent research has moved toward game-theoretic and structural solutions to make coercion impossible or unprofitable:

  1. Decoy Ballots: David C. Parkes and Lirong Xia propose distributing indistinguishable decoy ballots. Voters can sell these decoys to a briber, who wastes their budget on votes that the election authority never counts.
  2. Dummy Voting Power: In the context of weighted voting (like DAOs), Zeyuan Yin and Bingsheng Zhang introduce dummy voting power. This allows a voter to show a coercer a proof of a specific vote while their "real" voting power is actually applied to a different choice.
  3. Latent Transparency: Josh Benaloh and Vanessa J. Teague advocate for risk-limiting audits that use statistical sampling. This provides high certainty in the outcome without ever requiring the disclosure of individual ballot data.

Formalizing Trust

Because these protocols are incredibly complex, researchers have turned to formal verification to find hidden flaws. Sevdenur Baloğlu and Jun Pang have developed symbolic frameworks to automatically test protocols for "clash attacks," where a malicious server might assign the same receipt to multiple voters to hide ballot stuffing.

Their work on the Estonian E-Voting protocol and systems like Helios and Belenios highlights that even widely used systems can have subtle vulnerabilities where the very mechanisms intended to provide verifiability can be exploited to undermine privacy. The goal of this research direction is to move beyond "honest but curious" assumptions—as explored by Jun Pang and Chenyi Zhang in preliminary reports—to create systems that are mathematically guaranteed to be both transparent and uncoercible.

Papers in this version

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 19 papers
  2. Version 1 · 2026-10-04 · 26 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_verifiability_privacy_tradeoff_feb9d862,
  title = {verifiability-privacy tradeoff},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/verifiability-privacy-tradeoff/rdr_feb9d8623dac4bdfa66d1677aaa505a6},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}

This exact version (version 1, frozen text):

@misc{lacuna_verifiable_and_receipt_free_electronic_v_feb9d862_v1,
  title = {Verifiable and Receipt-Free Electronic Voting Protocols},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/verifiable-and-receipt-free-electronic-voting-protocols/rdr_feb9d8623dac4bdfa66d1677aaa505a6/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}