The Paper Ballot Problem
In an era where we trust the internet with our life savings, our medical records, and our most intimate conversations, it seems absurd that we still rely on pieces of paper and cardboard boxes to elect our leaders.
Yet, cybersecurity experts universally agree: internet voting is currently a terrible idea.
The core issue isn’t just about hackers changing numbers in a database. It is about the fundamental paradox of democracy. An election must satisfy two completely conflicting requirements:
- The Secret Ballot: No one should ever know who you voted for (to prevent voter coercion and vote-buying).
- The Verifiable Tally: Everyone must be able to verify that all votes were counted correctly without tampering.
Traditional databases cannot do both. If you make the database public for verification, you destroy the secret ballot. If you hide the database to protect privacy, you destroy trust in the tally.
Solving the Democratic Paradox
Homomorphic Encryption (FHE) offers the only mathematically sound exit from this trap. It allows us to count votes without ever looking at the ballots.
Here is how an FHE-powered election works in practice:
When a citizen casts a vote on their device, the app encrypts the choice (e.g., “Candidate A = 1, Candidate B = 0”) before it ever hits the internet. The election authority receives millions of these encrypted blobs.
Because of the homomorphic properties, the central server can simply add all the encrypted ballots together. Encrypted Vote 1 + Encrypted Vote 2 + ... = Encrypted Total.
At no point does the server decrypt individual votes. The server literally doesn’t know who anyone voted for. Once the tallying is complete, a decentralized group of election officials (using Multi-Party Computation or MPC) combine their partial keys to decrypt only the final total.
Bulletproof Verification
But what if someone tries to cheat the system by submitting a million votes in a single encrypted payload?
This is where FHE is paired with Zero-Knowledge Proofs (ZKPs). Along with their encrypted vote, each voter’s device submits a cryptographic proof that essentially says: “I promise this encrypted blob contains exactly one valid vote, and I am not voting twice, without revealing who I voted for.”
Anyone—from rival political parties to independent journalists—can download the public ledger of encrypted votes and run the math themselves. They can verify that the final tally is 100% accurate, even though the individual ballots remain permanently locked.
The Future of Trust
We are facing a global crisis of trust in democratic institutions. Suspicion of electoral fraud is higher than ever.
Transitioning to FHE-based voting systems won’t happen overnight; the mathematical overhead is still significant, and public education on cryptography is a massive hurdle. However, it is the only viable path forward. It replaces “trust us, the system works” with “here is the math, check it yourself.”