BVOT: Self-Tallying Boardroom Voting with Oblivious Transfer

10/06/2020
by   Farid Javani, et al.
0

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 audit phase. By hiding the mapping between primes and candidates, BVOT provides voters with insufficient information to carry out effective cheating. The threshold feature prevents anyone from computing any partial tally—until everyone has voted. Multiplying all votes, their decryption shares, and the unmasking factor yields a product of the primes each raised to the number of votes received. In contrast to some existing boardroom voting protocols, BVOT does not rely on any zero-knowledge proof; instead, it uses oblivious transfer to assure ballot secrecy and correct vote casting. Also, BVOT can handle multiple candidates in one election. BVOT prevents cheating by hiding crucial information: an attempt to increase the tally of one candidate might increase the tally of another candidate. After all votes are cast, any party can tally the votes.

READ FULL TEXT
research
03/15/2019

Secure Voting Protocols with Perfect Ballot Secrecy

Securing voters' privacy and ensuring the integrity of the voting proces...
research
12/29/2017

A multi-candidate electronic voting scheme with unlimited participants

In this paper a new multi-candidate electronic voting scheme is construc...
research
10/26/2022

Ballot stuffing and participation privacy in pollsite voting

We study the problem of simultaneously addressing both ballot stuffing a...
research
10/04/2022

The probability of casting a pivotal vote in an Instant Runoff Voting election

I derive the probability that a vote cast in an Instant Runoff Voting el...
research
08/26/2019

A universally verifiable voting protocol with complete cast-as-intended and counted-as-cast guarantees

We present a universally verifiable voting protocol and establish its co...
research
02/14/2022

Online Approval Committee Elections

Assume k candidates need to be selected. The candidates appear over time...
research
11/22/2020

Electt: running auditable and verifiable elections in untrusted environments

We present a system for running auditable and verifiable elections in un...

Please sign up or login with your details

Forgot password? Click here to reset