A Publicly Verifiable E-Voting System Based on Biometrics
-
Published:2023-11-28
Issue:4
Volume:7
Page:62
-
ISSN:2410-387X
-
Container-title:Cryptography
-
language:en
-
Short-container-title:Cryptography
Author:
Liu Jinhui12, Han Tianyi1, Tan Maolin1, Tang Bo12, Hu Wei1ORCID, Yu Yong1
Affiliation:
1. School of Cyber Security, Northwest Polytechnical University, Xi’an 710072, China 2. Research & Development Institute, Northwest Polytechnical University, Shenzhen 518057, China
Abstract
Voters use traditional paper ballots, a method limited by the factors of time and space, to ensure their voting rights are exercised; this method requires a lot of manpower and resources. Duplicate voting problems may also occur, meaning the transparency and reliability of the voting results cannot be guaranteed. With the rapid developments in science and technology, E-voting system technology is being adopted more frequently in election activities. However, E-voting systems still cannot address the verifiability of the election process; the results of a given election and the credibility of the host organization will be questioned if the election’s verifiability cannot be ensured. Elections may also pose a series of problems related to privacy, security, and so on. To address these issues, this paper presents a public, and verifiable E-voting system with hidden statistics; this system is based on commitment, zk-SNARKs, and machine learning. The system can deal with a large number of candidates, complex voting methods, and result functions in counting both hidden and public votes and can satisfy the requirements of verifiability, privacy, security, and intelligence. Our security analysis shows that our scheme achieves privacy, hidden vote counting and verifiability. Our performance evaluation demonstrates that our system has reasonable applications in real scenarios.
Funder
National Natural Science Foundation of China Natural Science Basic Research Plan in Shaanxi Province of China Shenzhen Fundamental Research Program
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Software
Reference27 articles.
1. Haines, T., Müller, J., and Querejeta-Azurmendi, I. (2023, January 27–31). Scalable coercion-resistant E-Voting under weaker trust assumptions. Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, Tallinn, Estonia. 2. Cortier, V., Gaudry, P., and Yang, Q. (2022, January 26–30). A toolbox for verifiable tally-hiding e-voting systems. Proceedings of the European Symposium on Research in Computer Security, Copenhagen, Denmark. 3. Ramchen, K., Culnane, C., Pereira, O., and Teague, V. (2019). Financial Cryptography and Data Security, Springer International Publishing. 4. Cortier, V., Galindo, D., Küsters, R., Müller, J., and Truderung, T. (2016, January 23–25). Sok: Verifiability notions for e-voting protocols. Proceedings of the 2016 IEEE Symposium on Security and Privacy (SP), San Jose, CA, USA. 5. Khlaponin, Y., Vyshniakov, V., Prygara, M., and Poltorak, V. (2020, January 6–9). The new concept of guaranteeing confidence in the E-voting system. Proceedings of the 2020 IEEE International Conference Science and Technology, Kharkiv, Ukraine.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|