DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authorities

被引:19
|
作者
Shahandashti, Siamak F. [1 ]
Hao, Feng [1 ]
机构
[1] Newcastle Univ, Sch Comp Sci, Newcastle Upon Tyne, Tyne & Wear, England
来源
关键词
D O I
10.1007/978-3-319-45741-3_12
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Nearly all verifiable e-voting schemes require trustworthy authorities to perform the tallying operations. An exception is the DRE-i system which removes this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly simplifies election management, the pre-computation of ballots necessitates secure ballot storage, as leakage of precomputed ballots endangers voter privacy. In this paper, we address this problem and propose DRE-ip (DRE-i with enhanced privacy). Adopting a different design strategy, DRE-ip is able to encrypt ballots in real time in such a way that the election tally can be publicly verified without decrypting the cast ballots. As a result, DRE-ip achieves end-to-end verifiability without tallying authorities, similar to DRE-i, but with a significantly stronger guarantee on voter privacy. In the event that the voting machine is fully compromised, the assurance on tallying integrity remains intact and the information leakage is limited to the minimum: only the partial tally at the time of compromise is leaked.
引用
收藏
页码:223 / 240
页数:18
相关论文
共 50 条
  • [1] E2E Verifiable Borda Count Voting System without Tallying Authorities
    Bag, Samiran
    Azad, Muhammad Ajmal
    Hao, Feng
    [J]. 14TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY (ARES 2019), 2019,
  • [2] Camel: E2E Verifiable Instant Runoff Voting without Tallying Authorities
    Harrison, Luke
    Bag, Samiran
    Hao, Feng
    [J]. PROCEEDINGS OF THE 19TH ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, ACM ASIACCS 2024, 2024, : 742 - 752
  • [3] Blockchain voting: Publicly verifiable online voting protocol without trusted tallying authorities
    Yang, Xuechao
    Yi, Xun
    Nepal, Surya
    Kelarev, Andrei
    Han, Fengling
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 112 : 859 - 874
  • [4] A Verifiable E-voting Scheme with Secret Sharing
    Yuan, Lifeng
    Li, Mingchu
    Guo, Cheng
    Hu, Weitong
    Tan, Xing
    [J]. 2015 IEEE 16TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY (ICCT), 2015, : 304 - 308
  • [5] VERICONDOR: End-to-End Verifiable Condorcet Voting without Tallying Authorities
    Harrison, Luke
    Bag, Samiran
    Luo, Hang
    Hao, Feng
    [J]. ASIA CCS'22: PROCEEDINGS OF THE 2022 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2022, : 1113 - 1125
  • [6] A Scheme for Three-way Secure and Verifiable E-Voting
    Nassar, Mohamed
    Malluhi, Qutaibah
    Khan, Tanveer
    [J]. 2018 IEEE/ACS 15TH INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS (AICCSA), 2018,
  • [7] A Privacy-Preserving E-voting Scheme with Verifiable Format
    Sun, Yuhong
    Wang, Jiatao
    Li, Fengyin
    [J]. 2023 INTERNATIONAL CONFERENCE ON DATA SECURITY AND PRIVACY PROTECTION, DSPP, 2023, : 77 - 85
  • [8] Homomorphic RSA Tallying and Its Randomization for e-Voting
    Yucel, Okan
    Baykal, Nazife
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON E-GOVERNMENT, 2010, : 160 - 167
  • [9] A verifiable multi-authority e-voting scheme for real world environment
    Taghavi, T.
    Kahani, M.
    Bafghi, A. G.
    [J]. ADVANCES AND INNOVATIONS IN SYSTEMS, COMPUTING SCIENCES AND SOFTWARE ENGINEERING, 2007, : 421 - 426
  • [10] An Efficient E2E Verifiable E-voting System without Setup Assumptions
    Kiayias, Aggelos
    Zacharias, Thomas
    Zhang, Bingsheng
    [J]. IEEE SECURITY & PRIVACY, 2017, 15 (03) : 14 - 23