Abstract
Electronic voting (e-voting) is widely used because of its convenience and efficiency. In response to the security problems in e-voting, such as the legality of voters, privacy disclosure, etc., this paper proposes a novel e-voting scheme that can check the format of ballots without disclosing its content based on homomorphic encryption. Firstly, voters encrypt their ballots with Paillier encryption before sending them to the counter. Then, the counter decomposes the encrypted ballots using the proposed n-ary conversion protocol, and performs the format check of the ballots. Only ballots with the correct format are counted. During the whole process of voting, no one except the voter himself can know each ballot’s content, even the counter, so that the privacy of ballots is preserved. Finally, the counter performs an additive homomorphism operation on the encrypted ballots and the voting manager decrypts it to tally the result. Besides the requirements including the legality, privacy, and integrity, we furtherly consider the validity of the ballots in e-voting and make the scheme more practical than the existing methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Pu, H.Q., Cui, Z., Liu, T.: A review of research on secure e-voting schemes. Comput. Sci. 47(9), 8 (2020)
Mursi, M.F.M., Assassa, G.M.R., Abdelhafez, A.: On the development of electronic voting: a survey. Int. J. Comput. Appl. 61(16), 1–11 (2013)
Peng, K.: A general and efficient countermeasure to relation attacks in mix-based e-voting. Int. J. Inf. Secur. 10(1), 49–60 (2011)
Ku, W.C., Wang, S.D.: A secure and practical electronic voting scheme. Comput. Commun. 22(3), 279–286 (1999)
Rivest, R.L., Shamir, A., Tauman, Y.: How to leak a secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45682-1_32
He, Q., Shen, W.: Homomorphic encryption-based multi-candidate e-voting scheme. Comput. Syst. Appl. 28(2), 146–151 (2019)
Kumar, M., Chand, S., Katti, C.P.: A secure end-to-end verifiable internet-voting system using identity-based blind signature. IEEE Syst. J. 14(2), 2032–2041 (2020)
Liu, Y., Zhao, Q.: E-voting scheme using secret sharing and K-anonmity. World Wide Web 22(4), 1657–1667 (2019)
Shahandashti, S.F., Hao, F.: DRE-ip: a verifiable E-voting scheme without tallying authorities. In: Askoxylakis, I., Ioannidis, S., Katsikas, S., Meadows, C. (eds.) ESORICS 2016. LNCS, vol. 9879, pp. 223–240. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45741-3_12
McCorry, P., Shahandashti, S.F., Hao, F.: A smart contract for boardroom voting with maximum voter privacy. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 357–375. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70972-7_20
Chaieb, M., Koscina, M., Yousfi, S., Lafourcade, P., Robbana, R.: Dabsters: a privacy preserving e-voting protocol for permissioned blockchain. In: Hierons, R.M., Mosbah, M. (eds.) ICTAC 2019. LNCS, vol. 11884, pp. 292–312. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-32505-3_17
Waheed, A., Din, N., Umar, A.I.: Novel blind signcryption scheme for e-voting system based on elliptic curves. Mehran Univ. Res. J. Eng. Technol. 40(2), 314–322 (2021)
Alam, K., Tamura, S., Rahman, S.: An electronic voting scheme based on revised-SVRM and confirmation numbers. IEEE Trans. Dependable Secure Comput. 99, 400–410 (2019)
Ajish, S., Anilkumar, K.S.: Secure mobile internet voting system using biometric authentication and wavelet based AES. J. Inf. Secur. Appl. 61(14), 102908 (2021)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Advances in Cryptology, pp. 223–238. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48910-X_16
Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56–73. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24676-3_4
Samanthula, B.K.K., Chun, H., Jiang, W.: An efficient and probabilistic secure bit-decomposition. InL ACM SIGSAC Symposium on Information, pp. 541–546. ACM (2013)
Liu, X., Deng, R.H., Choo, K.: An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Trans. Inf. Forensics Secur. 11(11), 2401–2414 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Sun, Y., Wang, S., Li, F., Wang, H. (2022). A Privacy Preserving and Format-Checkable E-voting Scheme. In: Wang, L., Segal, M., Chen, J., Qiu, T. (eds) Wireless Algorithms, Systems, and Applications. WASA 2022. Lecture Notes in Computer Science, vol 13472. Springer, Cham. https://doi.org/10.1007/978-3-031-19214-2_40
Download citation
DOI: https://doi.org/10.1007/978-3-031-19214-2_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-19213-5
Online ISBN: 978-3-031-19214-2
eBook Packages: Computer ScienceComputer Science (R0)