A Verifiable E-voting Scheme with Secret Sharing

Abstract Traditional e-voting schemes use centralized and nontransparent count centers, which leads to people's distrust of the centers and doubt of the voting on impartiality and correctness. In this paper, we propose a distributed and verifiable e-voting scheme based on Mignotte's threshold secret sharing scheme, which effectively balances the conflict of interest between voters and count centers. Additionally, this scheme can also resist potential attacks from malicious participants, and satisfy special requirements of e-voting, especially for privacy and accountability, which contradict each other. Moreover, voters take on the major computation load in our scheme, which effectively reduces the computation burden of the vote counter