Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules
Open Access
- 30 July 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-11
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.Keywords
All Related Versions
This publication has 37 references indexed in Scilit:
- A Toolbox for Verifiable Tally-Hiding E-Voting Systems2022
- Practical Strategy-Resistant Privacy-Preserving Elections2018
- Fast Large-Scale Honest-Majority MPC for Malicious Adversaries2018
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol2007
- Multipartite Secret Sharing by Bivariate Interpolation2006
- Some Ideal Secret Sharing Schemes2001
- Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract)2000
- A Secure and Optimally Efficient Multi-Authority Election Scheme1997
- Receipt-Free Mix-Type Voting Scheme1995
- Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA1988