2022/03/14 by Seyed Reza Hoseini Najarkolaei, Najarkolaei, Seyed Reza Hoseini, Narges Kazempour +5
Computer Science · Social Sciences · #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Internet Traffic Analysis and Secure E-voting #Privacy, Security, and Data Protection
paper · pdf · doi:10.48550/arxiv.2203.07355
openalex publication_date 2022/03/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.