Title: End-to-end verifiable cumulative voting without tallying authorities

Authors: Samiran Bag; Muhammad Ajmal Azad; Feng Hao

Addresses: Department of Computer Science, University of Warwick, Coventry, UK ' College of Science and Engineering, University of Derby, Derby, UK ' Department of Computer Science, University of Warwick, Coventry, UK

Abstract: In this paper, we propose the first end-to-end (E2E) verifiable e-voting system for cumulative voting without requiring any tallying authorities. To our knowledge, none of the existing e-voting systems implemented for cumulative voting are end-to-end verifiable; if there is any bug or tampering at the tallying software, the tally would be inadvertently modified without any voter noticing this. Although there are existing voting systems (e.g., mix-net-based) that could be adapted to support cumulative voting with E2E verifiability, they generally require a set of tallying authorities, which can lead to substantial complexity of finding and managing such authorities in practice. We address this issue by adopting novel cryptographic techniques to achieve E2E verifiability for cumulative voting, but without involving any tallying authorities. We formally define a model to prove the security of our system, and present the efficiency analysis to show that our proposed solution is feasible for practical use.

Keywords: end-to-end verifiability; verifiable e-voting; cumulative voting; provable security; receipt-freeness.

DOI: 10.1504/IJACT.2022.130833

International Journal of Applied Cryptography, 2022 Vol.4 No.2, pp.85 - 103

Received: 17 Jan 2020
Accepted: 07 Oct 2020
Published online: 12 May 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article