The Cryptographic Principles of E-Voting and the Necessity of Paper Ballots

Cryptography can improve e-voting privacy and verifiability, but paper ballots' physical audit trail remains irreplaceable.
The article examines the cryptographic mechanisms and security boundaries of e-voting. Systems rely on homomorphic encryption, zero-knowledge proofs, mixnets, and end-to-end verifiability to protect voter privacy while making tally correctness verifiable. Yet cryptography only solves mathematical problems; it cannot remove trust in hardware, software, firmware, and operators, and electronic systems risk silent failure. Paper ballots provide a physical audit trail independent of the software stack, supporting risk-limiting audits and dispute adjudication. The article also notes the tension between end-to-end verifiability and voter privacy, with deployments often relying on expert endorsement. Conclusion: without a trustworthy physical backup and transparent audit process, purely electronic voting should not be the sole method for mainstream elections.
Title
The Cryptographic Principles of E-Voting and the Necessity of Paper Ballots
Meta Description
An analysis of the cryptographic mechanisms behind e-voting—homomorphic encryption, zero-knowledge proofs, and end-to-end verifiability—and why, amid trust and auditability challenges, paper ballots remain an indispensable physical backup for election security.
Article Content
E-voting systems have long been viewed as a solution for improving efficiency and reducing costs, yet the cryptographic mechanisms and security boundaries behind them are rarely truly understood by the public. A recent article that sparked discussion on Hacker News, The cryptography behind e-voting (and why paper ballots are still essential), reexamines this topic: even though modern cryptography offers many ingenious tools, paper ballots remain irreplaceable.

The Cryptographic Toolbox of E-Voting
E-voting systems typically rely on several classes of cryptographic primitives to ensure security. Homomorphic encryption allows tallying operations to be performed directly on encrypted ballots, producing a total result without exposing the contents of any individual ballot; zero-knowledge proofs allow voters or auditors to verify the correctness of the tally without revealing any individual choice; and mixnets use layered encryption and shuffling to break the link between ballots and voter identities. In addition, end-to-end verifiability (E2E-V) is one of the core goals of e-voting design: it requires the system to prove that "cast ballots are correctly recorded" and that "recorded ballots are correctly counted," all without compromising voting privacy.
These technologies sound sufficient to build a secure and reliable e-voting system. The problem is that the security of cryptographic protocols depends on implementation details, key management, and trust assumptions—and elections tolerate zero errors.
Homomorphic encryption is based on the idea of allowing computations directly on ciphertexts, such that decrypting the result yields the same outcome as performing the same computation on the plaintexts. In e-voting, additively homomorphic schemes (such as Paillier encryption) are commonly used: the tallying authority multiplies all encrypted ballots together, and decryption yields the total vote count for each candidate without decrypting any individual ballot. This naturally protects individual ballot privacy, but it is computationally expensive and requires trusted key distribution and threshold decryption mechanisms to prevent a single point of malicious action.
Zero-knowledge proofs allow a prover to convince a verifier that a statement is true without revealing the secret itself. In voting scenarios, they can be used to prove that "the encryption of this ballot is valid (e.g., it selects exactly one candidate)," or that "the tallying process correctly performed the accumulation of all ballots," without exposing ballot contents. Practical systems often use non-interactive zero-knowledge proofs (NIZKs) to reduce interaction costs.
Mixnets, first proposed by Chaum, work by encrypting multiple messages layer by layer with multiple public keys, then having multiple mix nodes decrypt and randomly shuffle them in sequence, thereby breaking the correspondence between messages and senders. In e-voting, after ballots pass through a mixnet, auditors can verify that the output set matches the input set yet cannot associate any ballot with a specific voter, thus achieving anonymity.
Why Cryptography Is Not Enough
The article's core argument is that cryptography can solve problems at the mathematical level but cannot automatically solve trust problems. Voters need to trust the hardware, software, firmware, and the institutions operating these systems. If any layer is compromised, end-to-end guarantees may fail. More vexing still, e-voting failure modes are often "silent failures"—errors are not caught by the naked eye during manual review the way they are with paper ballots.
Another key point is auditability. Paper ballots provide a physical record independent of technology that can be used for statistical sample reviews such as risk-limiting audits (RLAs). Even if the electronic system deviates, the paper record can still serve as the ultimate basis of fact. The article emphasizes that paper ballots are not a rejection of technology but rather a physical layer of redundancy for technological systems.
Risk-limiting audits (RLAs) are an election review method based on statistical sampling. They do not require manually counting all paper ballots; instead, based on the margin of the election result and the desired risk level, they randomly sample a certain number of ballots for manual comparison. If the discrepancy between the electronic tally and the sampled manual count exceeds the statistical tolerance, the sample is expanded or a full recount is triggered. The mathematical foundation of RLAs enables them to confirm the correctness of election results with high confidence under a limited workload, making them a key institutional tool connecting the efficiency of electronic tallying with the auditability of paper records.
The Tension Between Verifiability and Privacy
E-voting systems must strike a balance between "verifiability" and "anonymity." End-to-end verifiability requires the system to disclose enough information for auditing, but this information must not be usable to trace specific voters' choices. The combination of zero-knowledge proofs and homomorphic encryption can theoretically satisfy this requirement, but in practical deployments, voters often find it difficult to understand or verify these proofs and ultimately still rely on the endorsement of experts and third-party institutions. This "transfer of trust" undermines the original intent of end-to-end verifiability.
The article also notes that voter verifiability (allowing voters to confirm for themselves that their ballots were correctly recorded) is especially difficult in remote voting scenarios, because malware could alter what voters see without their being able to detect it.
The Irreplaceable Role of Paper Ballots
Taken together, the value of paper ballots lies not in being "low-tech" but in providing a physical audit trail independent of the software stack. In hybrid systems, electronic tallying can improve efficiency, while paper records are used for sample reviews and dispute adjudication. The article's argument is not a wholesale rejection of e-voting but an emphasis that, without a trustworthy physical backup and a transparent audit process, purely electronic voting should not be the sole method for mainstream elections.
For researchers and policymakers concerned with election security, this discussion is a reminder that evaluating technical solutions cannot rely solely on cryptographic proofs; it must also consider whether they can truly be verified and trusted under real-world threat models and institutional constraints.
One-line Summary
Cryptography can enhance the privacy and verifiability of e-voting, but the physical audit trail of paper ballots remains irreplaceable.
Paragraph Summary
The article discusses the cryptographic mechanisms and security boundaries of e-voting. E-voting systems rely on tools such as homomorphic encryption, zero-knowledge proofs, mixnets, and end-to-end verifiability in an attempt to protect voter privacy while making the correctness of the tally verifiable. However, cryptography can only solve problems at the mathematical level; it cannot eliminate dependence on trust in hardware, software, firmware, and operating institutions, and electronic systems carry the risk of silent failure. Paper ballots provide a physical audit trail independent of the software stack that can support risk-limiting audits and dispute adjudication. The article also points out the tension between end-to-end verifiability and voter privacy, noting that practical deployments often still rely on expert endorsement. The conclusion is that, without a trustworthy physical backup and a transparent audit process, purely electronic voting should not be the sole method for mainstream elections.
Related articles

DeepSeek Harness Quick Start Guide: From Installation to 5 Real-World Cases
What is DeepSeek Harness? Based on a Bilibili tutorial, this article covers how this AI Agents software works, installation and setup, four working modes, and five real-world cases: a 3D racing game, official website, music player, science animation, and self-developed plugin—plus token money-saving tips.

Breaking Down DeepSeek's Super-agent Architecture: How Router+Worker Solves the Multi-Session Management Bottleneck
An analysis of DeepSeek's Super-agent paper: how the Router+Worker two-tier architecture uses Fast Pass, Chain of Recall, and storage-compute separation to solve multi-AI-session management bottlenecks, and how much it truly alleviates the human attention bottleneck and what engineering trade-offs it makes.

19K Stars in 5 Days: Why DeepSeek's Open-Source AI Programmer Went Viral
DeepSeek's open-source AI programmer hit 19K GitHub stars in 5 days. Why it went viral: the agent boom, AI writing its own code, and the shift from Q&A tools to AI employees.