End-to-end verifiable cumulative voting without tallying authorities Online publication date: Fri, 12-May-2023
by Samiran Bag; Muhammad Ajmal Azad; Feng Hao
International Journal of Applied Cryptography (IJACT), Vol. 4, No. 2, 2022
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Cryptography (IJACT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook