Toggle Main Menu Toggle Search

Open Access padlockePrints

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

Lookup NU author(s): Dr Siamak Fayyaz Shahandashti, Professor Feng Hao



This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).


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.

Publication metadata

Author(s): Shahandashti SF, Hao F

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: ESORICS 2016

Year of Conference: 2016

Pages: 223-240

Online publication date: 15/09/2016

Acceptance date: 27/06/2016

Date deposited: 10/10/2016

Publisher: Springer


DOI: 10.1007/978-3-319-45741-3_12

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783319457413