Information-Theoretic Secure and Private Voting System

In this paper, we present a private voting system that consists of N authorized voters who may vote to one of the K candidates or vote abstain. Each voter wants to compute the final tally while staying private and robust against malicious voters, who try to gain information about the vote of the other voters beyond the final result, or send incorrect information to affect the final tally. We design an information-theoretic private voting system based on Shamir secret sharing, which is secure and robust as long as there are up to (N-1)/3 malicious voters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2019

Secure Voting Protocols with Perfect Ballot Secrecy

Securing voters' privacy and ensuring the integrity of the voting proces...
research
02/14/2019

Potentially Information-theoretic Secure Y00 Quantum Stream Cipher with Limited Key Lengths beyond One-Time Pad

The previous work showed that the Y00 protocol could stay secure with th...
research
08/22/2020

Proverum: A Hybrid Public Verifiability and Decentralized Identity Management

Trust in electoral processes is fundamental for democracies. Further, th...
research
10/30/2022

Tournesol: Permissionless Collaborative Algorithmic Governance with Security Guarantees

Recommendation algorithms play an increasingly central role in our socie...
research
10/02/2020

X-Secure T-Private Federated Submodel Learning

The problem of (information-theoretic) X-secure T-private federated subm...
research
04/10/2020

Coded Secure Multi-Party Computation for Massive Matrices with Adversarial Nodes

In this work, we consider the problem of secure multi-party computation ...
research
12/09/2020

Persuading Voters in District-based Elections

We focus on the scenario in which an agent can exploit his information a...

Please sign up or login with your details

Forgot password? Click here to reset