ORCID

Abstract

Ensuring both cast-as-intended (CAI) verifiability and coercion-resistance in e-voting remains a critical challenge. The e-voting scheme proposed by Finogina and Herranz in 2023 represents the first notable advancement in reconciling these conflicting requirements. CAI verifiability allows voters to confirm that their intended vote has been correctly recorded, even without a secure channel to the election committee, while coercion-resistance prevents external influence and vote-selling. However, essential security properties such as confidentiality, anonymity, unforgeability, and double-voting prevention fall outside the scope of Finogina and Herranz’s e-voting scheme, leaving significant gaps in its security guarantees. To address this limitation, we propose a novel e-voting scheme that simultaneously achieves CAI verifiability, coercion-resistance, confidentiality, anonymity, unforgeability, and double-voting prevention while maintaining an asymptotic complexity of O(n). To the best of our knowledge, no existing scheme satisfies all these properties concurrently. Moreover, we establish that anonymity inherently implies CAI verifiability in e-voting schemes, a result of independent interest. By strengthening security and privacy guarantees, our work bridges existing gaps and provides a comprehensive security model that serves as a foundation for the design of future e-voting systems.

Publication Date

2025-01-01

Publication Title

PLoS ONE

Volume

20

Issue

6 JUNE

ISSN

1932-6203

Acceptance Date

2025-04-22

Deposit Date

2025-11-12

Download

Share

COinS