Problem
Research questions and friction points this paper is trying to address.
Securing order-based voting with distributed tallying
Ensuring ballot secrecy using multiparty computation
Implementing scalable e-voting for real-life elections
Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules
🤖 AI Summary
Balancing result correctness and voter privacy remains challenging in ordinal electronic voting. Method: We design and implement the first secure virtual election system supporting general ordinal voting rules (e.g., STV, Borda), built upon a secure multi-party computation framework that integrates secret sharing, zero-knowledge proofs, and distributed aggregation protocols. Contribution/Results: Our system achieves perfect ballot secrecy—only the final outcome is revealed, with no leakage of intermediate votes or partial tally states—establishing the first theoretical guarantee of such privacy for ordinal elections. An efficient encoding mechanism significantly reduces computational overhead, enabling real-time deployment for thousands of voters. The system simultaneously satisfies security, verifiability, and practicality, providing a scalable cryptographic foundation for trustworthy electronic elections.
📝 Abstract
Electronic voting systems have significant advantages in comparison with physical voting systems. One of the main challenges in e-voting systems is to secure the voting process: namely, to certify that the computed results are consistent with the cast ballots and that the voters’ privacy is preserved. We propose herein a secure voting protocol for elections that are governed by order-based voting rules. Our protocol offers perfect ballot secrecy in the sense that it issues only the required output while no other information on the cast ballots is revealed. Such perfect secrecy, achieved by employing secure multiparty computation tools, may increase the voters’ confidence and, consequently, encourage them to vote according to their true preferences. Evaluation of the protocol’s computational costs establishes that it is lightweight and can be readily implemented in real-life electronic elections.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Distributed tallying among independent talliers
Secure multiparty computation for privacy
Order-based voting rules implementation
🔎 Similar Papers
No similar papers found.
