On the feasibility of E2E verifiable online voting - A case study from Durga Puja trial

被引:0
|
作者
Druliac, Horia [1 ]
Bardsley, Matthew [1 ]
Riches, Chris [1 ]
Dunn, Christian [1 ]
Harrison, Luke [1 ]
Roy, Bimal [2 ]
Hao, Feng [1 ]
机构
[1] Univ Warwick, Coventry, England
[2] Indian Stat Inst, Kolkata, India
关键词
E2E verifiable e-voting; Internet voting; Mobile phone voting;
D O I
10.1016/j.jisa.2024.103719
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
India is the largest democracy by population and has one of the largest deployments of e -voting in the world for national elections. However, the e -voting machines used in India are not end -to -end (E2E) verifiable. The inability to verify the tallying integrity of an election by the public leaves the outcome open to disputes. E2E verifiable e -voting systems are commonly regarded as the most promising solution to address this problem, but they had not been implemented or trialed in India. It was unclear whether such systems would be usable and practical to the Indian people. Previous works such as Helios require a set of tallying authorities (TAs) to perform the decryption and tallying operations, but finding and managing TAs can prove difficult. This paper presents a TA -free E2E verifiable online voting system based on the DRE-ip protocol. In collaboration with the local authority of New Town, Kolkata, India, we conducted an online voting trial as part of the 2022 Durga Puja festival celebration, during which residents of New Town were invited to use mobile phones to vote for their favorite pujas (festival decorations) in an E2E verifiable manner. 543 participants attended the Durga Puja trial and 95 of them provided feedback by filling in an anonymous survey after voting. Based on the voter feedback, participants generally found the system easy to use. This was the first time that an E2E online voting system had been built and tested in India, suggesting its feasibility for non -statutory voting scenarios.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] E2E Verifiable Electronic Voting System for Shareholders
    Bag, Samiran
    Hao, Feng
    [J]. 2019 IEEE CONFERENCE ON DEPENDABLE AND SECURE COMPUTING (DSC), 2019, : 118 - 125
  • [2] An Efficient E2E Crowd Verifiable E-Voting System
    Zhang, Xinyu
    Zhang, Bingsheng
    Kiayias, Aggelos
    Zacharias, Thomas
    Ren, Kui
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (06) : 3607 - 3620
  • [3] 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
  • [4] 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
  • [5] 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,
  • [6] Vulnerability studies of E2E voting systems
    Rura, Lauretha
    Issac, Biju
    Haldar, Manas
    [J]. Lecture Notes in Electrical Engineering, 2015, 313 : 223 - 231
  • [7] Attacking Paper-Based E2E Voting Systems
    Kelsey, John
    Regenscheid, Andrew
    Moran, Tal
    Chaum, David
    [J]. TOWARDS TRUSTWORTHY ELECTIONS: NEW DIRECTIONS IN ELECTRONIC VOTING, 2010, 6000 : 370 - +
  • [8] Scratch, Click & Vote: E2E Voting over the Internet
    Kutylowski, Miroslaw
    Zagorski, Filip
    [J]. TOWARDS TRUSTWORTHY ELECTIONS: NEW DIRECTIONS IN ELECTRONIC VOTING, 2010, 6000 : 343 - 356
  • [9] Simulation-based analysis of E2E voting systems
    de Marneffe, Olivier
    Pereira, Olivier
    Quisquater, Jean-Jacques
    [J]. E-VOTING AND IDENTITY, 2007, 4896 : 137 - 149
  • [10] DEMOS-2: Scalable E2E Verifiable Elections without Random Oracles
    Kiayias, Aggelos
    Zacharias, Thomas
    Zhang, Bingsheng
    [J]. CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, : 352 - 363