SecureVote: A Verifiable E-Voting Based on Generic Score Voting Rules
Abstract
The electronic voting system guarantees the impar-tial, confidential and secure execution of the voting process. However, most existing electronic voting schemes are tailored to specific voting rules and employ particular encryption tools to ensure swift elections under predefined conditions. This often limits their adaptability to accommodate diverse voting modes. Addressing these challenges, the SecureVote scheme proposed in this article incorporates score-based voting rules, supports five different voting rules, thereby catering to a wide range of real-world electronic voting scenarios. The Secure Vote can ensure the privacy and anonymity of the scheme through homomorphic encryption and privacy set intersection technology, and at the same time use non-interactive zero-knowledge proofs to ensure the verifiability of voting, and is better than the scheme with a central trust entity in terms of communication, efficiency and rationality. Finally, we illustrate the nature and efficiency of the scheme through safety proofs and experiments.
Community
0 commentsNo discussion yet
Be the first to share a question or observation.