Designing a Robust Quantum Signature Protocol Based on Quantum Key Distribution for E-Voting Applications
-
Published:2024-08-19
Issue:16
Volume:12
Page:2558
-
ISSN:2227-7390
-
Container-title:Mathematics
-
language:en
-
Short-container-title:Mathematics
Author:
Prajapat Sunil1, Gautam Urmika1, Gautam Deepika1, Kumar Pankaj1ORCID, Vasilakos Athanasios V.23
Affiliation:
1. Srinivasa Ramanujan Department of Mathematics, Central University of Himachal Pradesh, Dharamshala 176215, India 2. Department of Networks and Communications, College of Computer Science and Information Technology, Imam Abdulrahman Bin Faisal University (IAU), P.O. Box 1982, Dammam 31441, Saudi Arabia 3. Center for AI Research (CAIR), University of Agder (UiA), 4879 Grimstad, Norway
Abstract
The rapid advancement of internet technology has raised attention to the importance of electronic voting in maintaining democracy and fairness in elections. E-voting refers to the use of electronic technology to facilitate the casting and counting of votes in elections. The need for designated verification arises from concerns about voter privacy, auditability, and the prevention of manipulation. Traditional e-voting systems use cryptographic techniques for security but lack verifiable proof of integrity. Integrating e-voting with a quantum designated verifier could address these challenges by leveraging the principles of quantum mechanics to enhance security and trustworthiness. In light of this, we propose a quantum e-voting scheme that uses a designated verifier signature. To ensure the confidentiality and authenticity of the voting process, the scheme uses quantum features like the no-cloning theorem and quantum key distribution. The proposed scheme has security properties like source hiding, non-transferability, and message anonymity. The proposed scheme is resistant to many quantum attacks, such as eavesdropping and impersonation. Due to designated verification, the scheme minimizes the risk of tempering. This paper provides a detailed description of the proposed scheme and analyzes its security properties. Therefore, the proposed scheme is efficient, practical, and secure.
Reference27 articles.
1. An elaborate secure quantum voting scheme;Zhang;Int. J. Theor. Phys.,2017 2. Quantum election protocol based on quantum public key cryptosystem;Gao;Secur. Commun. Netw.,2021 3. An efficient quantum-resistant undeniable signature protocol for the E-voting system;Li;J. Inf. Secur. Appl.,2024 4. Bernhard, M., Benaloh, J., Alex Halderman, J., Rivest, R.L., Ryan, P.Y., Stark, P.B., Teague, V., Vora, P.L., and Wallach, D.S. (2017, January 24–27). Public evidence from secret ballots. Proceedings of the Electronic Voting: Second International Joint Conference, E-Vote-ID 2017, Bregenz, Austria. Proceedings 2. 5. Del Pino, R., Lyubashevsky, V., Neven, G., and Seiler, G. (November, January 30). Practical quantum-safe voting from lattices. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA.
|
|