A Novel Approach to E-Voting With Group Identity-Based Identification and Homomorphic Encryption Scheme
This article presents a novel e-voting scheme that combines Group Identity-based Identification (GIBI) with Homomorphic Encryption (HE) based on the discrete logarithmic assumption. The proposed scheme uses the Schnorr-like GIBI scheme for voter identification and authorization using zero-knowledge...
Saved in:
| Published in | IEEE access Vol. 12; pp. 162825 - 162843 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
Piscataway
IEEE
2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2169-3536 2169-3536 |
| DOI | 10.1109/ACCESS.2024.3408670 |
Cover
| Summary: | This article presents a novel e-voting scheme that combines Group Identity-based Identification (GIBI) with Homomorphic Encryption (HE) based on the discrete logarithmic assumption. The proposed scheme uses the Schnorr-like GIBI scheme for voter identification and authorization using zero-knowledge proofs to ensure the anonymity and eligibility of voters. The voter <inline-formula> <tex-math notation="LaTeX">\textsf {v}_{i,j} </tex-math></inline-formula> is granted the authorization to cast a valid vote for a single candidate <inline-formula> <tex-math notation="LaTeX">\textsf {C}_{k} </tex-math></inline-formula>. The use of distributed ElGamal provides fairness while the use of partial shares for decryption enables individual and universal verifiability without the need for a central authority. The proposed scheme is secure under various scenarios and robust in the random oracle model. The GIBI-HE scheme offers a promising solution for e-voting, providing a sustainable and accessible environment for voters while supporting the unreusability of votes and protecting the privacy of voters. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2169-3536 2169-3536 |
| DOI: | 10.1109/ACCESS.2024.3408670 |