A Verifiable E-voting Scheme with Secret Sharing

Traditional e-voting schemes use centralized and nontransparent count centers which leads to distrust of the centers and their 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. Our scheme effectively regulates the interests contlict between voters and count centers. Additionally, the scheme also resists the attacks by malicious participants and satisfies special requirements of e-voting, especially for privacy and accountability, which contradict each other. Moreover, the distributed technologies our scheme uses greatly improve the efficiency of computing.