skip to main content
10.1145/3339252.3339259acmotherconferencesArticle/Chapter ViewAbstractPublication PagesaresConference Proceedingsconference-collections
research-article

E2E Verifiable Borda Count Voting System without Tallying Authorities

Published: 26 August 2019 Publication History

Abstract

An end-to-end verifiable (E2E) voting system enables candidates, voters and observers to monitor the integrity of an election process and verify the results without relying on trusted systems. In this paper, we propose a DRE-based Borda count e-voting system called DRE-Borda. The proposed system is E2E verifiable without involving any tallying authorities. Furthermore, it outputs only the total score a candidate gets without revealing any other information such as the breakdown of scores with respect to different ranks. This reduces the information leakage from the tallying result to the minimum, hence effectively preventing Italian attacks. When the DRE machine is completely compromised, the integrity of the tallying result is still preserved and what an adversary can learn from a compromised machine is strictly limited to the partial tally at the time of compromise.

References

[1]
Michel Abdalla and David Pointcheval. 2005. Simple password-based encrypted key exchange protocols. In Cryptographers' track at the RSA conference. Springer, 191--208.
[2]
Ben Adida. 2008. Helios: Web-based Open-audit Voting. In Proceedings of the 17th Conference on Security Symposium (SS'08). USENIX Association, Berkeley, CA, USA, 335--348. http://dl.acm.org/citation.cfm?id=1496711.1496734
[3]
Ben Adida, Olivier De Marneffe, Olivier Pereira, Jean-Jacques Quisquater, et al. 2009. Electing a university president using open-audit voting: Analysis of real-world use of Helios. EVT/WOTE 9, 10 (2009).
[4]
Ben Adida and Ronald L. Rivest. 2006. Scratch & Vote: Self-contained Paper-based Cryptographic Voting. In Proceedings of the 5th ACM Workshop on Privacy in Electronic Society (WPES '06). ACM, New York, NY, USA, 29--40.
[5]
Syed Taha Ali and Judy Murray. 2016. An overview of end-to-end verifiable voting systems. Real-world electronic voting: Design, analysis and deployment (2016), 171--218.
[6]
Susan Bell, Josh Benaloh, Michael D. Byrne, Dana Debeauvoir, Bryce Eakin, Philip Kortum, Neal McBurnett, Olivier Pereira, Philip B. Stark, Dan S. Wallach, Gail Fisher, Julian Montoya, Michelle Parker, and Michael Winn. 2013. STAR-Vote: A Secure, Transparent, Auditable, and Reliable Voting System. In 2013 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections (EVT/WOTE 13). USENIX Association, Washington, D.C. https://www.usenix.org/conference/evtwote13/workshop-program/presentation/bell
[7]
Josh Benaloh. 2006. Simple Verifiable Elections. EVT 6 (2006), 5--5.
[8]
J. Benaloh, T. Moran, L. Naish, K. Ramchen, and V. Teague. 2009. Shuffle-Sum: Coercion-Resistant Verifiable Tallying for STV Voting. IEEE Transactions on Information Forensics and Security 4, 4 (Dec 2009), 685--698.
[9]
Josh Benaloh, Tal Moran, Lee Naish, Kim Ramchen, and Vanessa Teague. 2009. Shuffle-sum: coercion-resistant verifiable tallying for STV voting. IEEE Transactions on Information Forensics and Security 4, 4 (2009), 685--698.
[10]
Jonah Berger. 2018. Undergraduate Council Adopts New Voting Method for Elections. https://www.thecrimson.com/article/2018/9/10/uc-voting-system/
[11]
David Chaum. 2004. Secret-ballot receipts: True voter-verifiable elections. IEEE security & privacy 2, 1 (2004), 38--47.
[12]
David Chaum, Richard Carback, Jeremy Clark, Aleksander Essex, Stefan Popoveniuc, Ronald L. Rivest, Peter Y. A. Ryan, Emily Shen, and Alan T. Sherman. 2008. Scantegrity II: End-to-end Verifiability for Optical Scan Election Systems Using Invisible Ink Confirmation Codes. In Proceedings of the Conference on Electronic Voting Technology (EVT'08). USENIX Association, Berkeley, CA, USA, Article 14, 13 pages. http://dl.acm.org/citation.cfm?id=1496739.1496753
[13]
D. Chaum, A. Essex, R. Carback, J. Clark, S. Popoveniuc, A. Sherman, and P. Vora. 2008. Scantegrity: End-to-End Voter-Verifiable Optical- Scan Voting. IEEE Security & Privacy 6, 3 (May 2008), 40--46.
[14]
Kevin Fisher, Richard Carback, and Alan T. Sherman. 2006. Punchscan: Introduction and System Definition of a High-Integrity Election System. In Workshop on Trustworthy Election. 2006.
[15]
Jon Fraenkel and Bernard Grofman. 2014. The Borda Count and its real-world alternatives: Comparing scoring rules in Nauru and Slovenia. Australian Journal of Political Science 49, 2 (2014), 186--205.
[16]
Feng Hao, Dylan Clarke, Brian Randell, and Siamak F Shahandashti. 2018. Verifiable Classroom Voting in Practice. IEEE Security & Privacy 16, 1 (2018), 72--81.
[17]
Feng Hao, Matthew N. Kreeger, Brian Randell, Dylan Clarke, Siamak F. Shahandashti, and Peter Hyun-Jeen Lee. 2014. Every Vote Counts: Ensuring Integrity in Large-Scale Electronic Voting. In 2014 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections (EVT/WOTE 14). USENIX Association, San Diego, CA. https://www.usenix.org/conference/evtwote14/workshop-program/presentation/hao
[18]
James Heather, Peter Y. A. Ryan, and Vanessa Teague. 2010. Pretty Good Democracy for More Expressive Voting Schemes. In Proceedings of the 15th European Conference on Research in Computer Security (ESORICS'10). Springer-Verlag, Berlin, Heidelberg, 405--423. http://dl.acm.org/citation.cfm?id=1888881.1888913
[19]
Jason Keller and Joe Kilian. 2008. A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting. In Advances in Cryptology - ASIACRYPT 2008, Josef Pieprzyk (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 198--215.
[20]
A. Kiayias, M. Korman, and D. Walluck. 2006. An Internet Voting System Supporting User Privacy. In 2006 22nd Annual Computer Security Applications Conference (ACSAC'06). 165--174.
[21]
C. Andrew Neff. 2004. Practical High Certainty Intent Verification for Encrypted Votes.
[22]
P. Y. A. Ryan, D. Bismark, J. Heather, S. Schneider, and Z. Xia. 2009. Prêt á voter Voter: a Voter-Verifiable Voting System. IEEE Transactions on Information Forensics and Security 4, 4 (Dec 2009), 662--673.
[23]
Siamak F Shahandashti. 2016. Electoral Systems Used around the World. In Real-World Electronic Voting (Eds. Hao, Ryan). CRC Press, 93--118.
[24]
Siamak F Shahandashti and Feng Hao. 2016. DRE-ip: a verifiable e-voting scheme without tallying authorities. In European Symposium on Research in Computer Security. Springer, 223--240.
[25]
Vanessa Teague, Kim Ramchen, and Lee Naish. 2008. Coercion-Resistant Tallying for STV Voting. In EVT.

Cited By

View all
  • (2025)Enhancing Democratic Processes: A Survey of DRE, Internet, and Blockchain in Electronic Voting SystemsIEEE Access10.1109/ACCESS.2025.353134913(20512-20545)Online publication date: 2025
  • (2024)On the feasibility of E2E verifiable online voting – A case study from Durga Puja trialJournal of Information Security and Applications10.1016/j.jisa.2024.10371981(103719)Online publication date: Mar-2024
  • (2022)VERICONDORProceedings of the 2022 ACM on Asia Conference on Computer and Communications Security10.1145/3488932.3497758(1113-1125)Online publication date: 30-May-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ARES '19: Proceedings of the 14th International Conference on Availability, Reliability and Security
August 2019
979 pages
ISBN:9781450371643
DOI:10.1145/3339252
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 August 2019

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Borda count election
  2. Direct-recording electronic voting machine
  3. E-voting
  4. End-to-end verifiability
  5. Non-interactive zero knowledge proof

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Funding Sources

Conference

ARES '19

Acceptance Rates

Overall Acceptance Rate 228 of 451 submissions, 51%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)2
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Enhancing Democratic Processes: A Survey of DRE, Internet, and Blockchain in Electronic Voting SystemsIEEE Access10.1109/ACCESS.2025.353134913(20512-20545)Online publication date: 2025
  • (2024)On the feasibility of E2E verifiable online voting – A case study from Durga Puja trialJournal of Information Security and Applications10.1016/j.jisa.2024.10371981(103719)Online publication date: Mar-2024
  • (2022)VERICONDORProceedings of the 2022 ACM on Asia Conference on Computer and Communications Security10.1145/3488932.3497758(1113-1125)Online publication date: 30-May-2022
  • (2021)A Node Preference-Aware Delegated Proof of Stake Consensus Algorithm With Reward and Punishment MechanismWireless Algorithms, Systems, and Applications10.1007/978-3-030-85928-2_45(572-583)Online publication date: 2-Sep-2021
  • (2020)A Smart Contract System for Decentralized Borda Count VotingIEEE Transactions on Engineering Management10.1109/TEM.2020.298637167:4(1323-1339)Online publication date: Nov-2020

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media