BVOT: Self-Tallying Boardroom Voting with Oblivious Transfer
Farid Javani, Alan T. Sherman

TL;DR
BVOT introduces a secure, fair, and dispute-free self-tallying boardroom voting protocol that leverages oblivious transfer and threshold homomorphic encryption, ensuring ballot secrecy and resistance to cheating without zero-knowledge proofs.
Contribution
It presents BVOT, a novel voting protocol that combines oblivious transfer with threshold encryption, eliminating the need for zero-knowledge proofs and supporting multiple candidates.
Findings
Ensures ballot secrecy and fairness in small elections.
Prevents cheating by hiding candidate-prime mappings.
Allows any party to tally votes after all votes are cast.
Abstract
A boardroom election is an election with a small number of voters carried out with public communications. We present BVOT, a self-tallying boardroom voting protocol with ballot secrecy, fairness (no tally information is available before the polls close), and dispute-freeness (voters can observe that all voters correctly followed the protocol). BVOT works by using a multiparty threshold homomorphic encryption system in which each candidate is associated with a masked unique prime. Each voter engages in an oblivious transfer with an untrusted distributor: the voter selects the index of a prime associated with a candidate and receives the selected prime in masked form. The voter then casts their vote by encrypting their masked prime and broadcasting it to everyone. The distributor does not learn the voter's choice, and no one learns the mapping between primes and candidates until the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
