Skip to main content

2024 | OriginalPaper | Buchkapitel

A New Quantum-Resistant Electronic Voting Based on Fully Homomorphic Encryption

verfasst von : Meryem Cherkaoui Semmouni, Mostafa Belkasmi, Abderrahmane Nitaj, Ali Azougaghe

Erschienen in: Artificial Intelligence for Sustainable Energy

Verlag: Springer Nature Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The emergence of large quantum computers running Shor’s algorithm threatens the security of several cryptographic schemes in current use, including electronic voting. As a consequence, many post-quantum candidates that are quantum-resistant are actively investigated. Post-quantum schemes-based hard lattice problems are particularly promising. In this paper, we present and implement a new quantum-resistant electronic voting scheme and prove its efficiency and security by studying its algebraic complexity. Our scheme is based on a combination of two techniques: hard lattice problems and homomorphic encryption with Fan and Vercauteren system.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Ahmad, T., Hu, J., Han, S.: An efficient mobile voting system security scheme based on elliptic curve cryptography. In: 2009 Third International Conference on Network and System Security, pp. 474–479. IEEE (2009) Ahmad, T., Hu, J., Han, S.: An efficient mobile voting system security scheme based on elliptic curve cryptography. In: 2009 Third International Conference on Network and System Security, pp. 474–479. IEEE (2009)
2.
Zurück zum Zitat Azougaghe, A., Kartit, Z., Hedabou, M., Belkasmi, M., Benmiloud, M., Marraki, M.: An Efficient Electronic Voting System in a Cloud Computing Environment (2015) Azougaghe, A., Kartit, Z., Hedabou, M., Belkasmi, M., Benmiloud, M., Marraki, M.: An Efficient Electronic Voting System in a Cloud Computing Environment (2015)
3.
Zurück zum Zitat Akleylek, S., Bindel, N., Buchmann, J., Kramer, J., and Marson, G. A.: An efficient lattice-based signature scheme with provably secure instantiation. In: International Conference on Cryptology in Africa, pp. 44–60. Springer, Cham (2016) Akleylek, S., Bindel, N., Buchmann, J., Kramer, J., and Marson, G. A.: An efficient lattice-based signature scheme with provably secure instantiation. In: International Conference on Cryptology in Africa, pp. 44–60. Springer, Cham (2016)
4.
Zurück zum Zitat Bajard, J.-C., et al.: A full RNS variant of FV like somewhat homomorphic encryption schemes. In: International Conference on Selected Areas in Cryptography. Springer, Cham (2016) Bajard, J.-C., et al.: A full RNS variant of FV like somewhat homomorphic encryption schemes. In: International Conference on Selected Areas in Cryptography. Springer, Cham (2016)
5.
6.
7.
Zurück zum Zitat Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 13 (2014)MathSciNet Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 13 (2014)MathSciNet
8.
Zurück zum Zitat Barreto, P.S., Longa, P., Naehrig, M., Ricardini, J.E., Zanon, G.: Sharper ring-LWE signatures. In: Cryptology ePrint Archive, Report 2016/1026 (2016) Barreto, P.S., Longa, P., Naehrig, M., Ricardini, J.E., Zanon, G.: Sharper ring-LWE signatures. In: Cryptology ePrint Archive, Report 2016/1026 (2016)
9.
Zurück zum Zitat Chen, H., Laine, K. and Player, R.: Simple encrypted arithmetic library-SEAL v2. 1. In: International Conference on Financial Cryptography and Data Security. Springer, Cham (2017) Chen, H., Laine, K. and Player, R.: Simple encrypted arithmetic library-SEAL v2. 1. In: International Conference on Financial Cryptography and Data Security. Springer, Cham (2017)
10.
Zurück zum Zitat Cervero, M. A., Mateu, V., Miret, J. M., Sebe, F., Valera, J.: An efficient homomorphic E-Voting system over elliptic curves. In: International Conference on Electronic Government and the Information Systems Perspective, pp. 41–53. Springer, Cham (2014, August) Cervero, M. A., Mateu, V., Miret, J. M., Sebe, F., Valera, J.: An efficient homomorphic E-Voting system over elliptic curves. In: International Conference on Electronic Government and the Information Systems Perspective, pp. 41–53. Springer, Cham (2014, August)
11.
Zurück zum Zitat Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: A homomorphic LWE based e-voting scheme. In: Post-Quantum Cryptography, pp. 245–265. Springer, Cham (2016) Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: A homomorphic LWE based e-voting scheme. In: Post-Quantum Cryptography, pp. 245–265. Springer, Cham (2016)
13.
Zurück zum Zitat Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology—CRYPTO 2013, volume 8042 of Lecture Notes in Computer Science, pp. 40–56, Springer. Santa Barbara (CA), USA (2013) Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal Gaussians. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology—CRYPTO 2013, volume 8042 of Lecture Notes in Computer Science, pp. 40–56, Springer. Santa Barbara (CA), USA (2013)
14.
Zurück zum Zitat Del Pino, R., Lyubashevsky, V., Neven, G., Seiler, G.: Practical quantum-safe voting from lattices. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1565–1581. ACM (2017) Del Pino, R., Lyubashevsky, V., Neven, G., Seiler, G.: Practical quantum-safe voting from lattices. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 1565–1581. ACM (2017)
15.
Zurück zum Zitat ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)MathSciNetCrossRef ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469–472 (1985)MathSciNetCrossRef
17.
Zurück zum Zitat Guneysu, T., Lyubashevsky, V., and Poppelmann, T.: Practical lattice-based cryptography: A signature scheme for embedded systems. In: Prouff, E., Schaumont, P. (eds.) Cryptographic Hardware and Embedded Systems—CHES 2012, volume 7428 of Lecture Notes in Computer Science, pp. 530–547. Springer (2012) Guneysu, T., Lyubashevsky, V., and Poppelmann, T.: Practical lattice-based cryptography: A signature scheme for embedded systems. In: Prouff, E., Schaumont, P. (eds.) Cryptographic Hardware and Embedded Systems—CHES 2012, volume 7428 of Lecture Notes in Computer Science, pp. 530–547. Springer (2012)
18.
Zurück zum Zitat Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)MathSciNetCrossRef Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)MathSciNetCrossRef
19.
Zurück zum Zitat Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRef Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120–126 (1978)MathSciNetCrossRef
20.
Zurück zum Zitat Sunuwar, R., Samal, S.K.: ElGamal Encryption using Elliptic Curve Cryptography. University of Nebraska, Lincoln, Cryptography and Computer Security (2015) Sunuwar, R., Samal, S.K.: ElGamal Encryption using Elliptic Curve Cryptography. University of Nebraska, Lincoln, Cryptography and Computer Security (2015)
21.
Zurück zum Zitat Zhao, Y., Pan, Y., Wang, S., et al.: An anonymous voting system based on homomorphic encryption. In: 2014 10th International Conference on Communications (COMM), pp. 1–4. IEEE (2014) Zhao, Y., Pan, Y., Wang, S., et al.: An anonymous voting system based on homomorphic encryption. In: 2014 10th International Conference on Communications (COMM), pp. 1–4. IEEE (2014)
Metadaten
Titel
A New Quantum-Resistant Electronic Voting Based on Fully Homomorphic Encryption
verfasst von
Meryem Cherkaoui Semmouni
Mostafa Belkasmi
Abderrahmane Nitaj
Ali Azougaghe
Copyright-Jahr
2024
Verlag
Springer Nature Singapore
DOI
https://doi.org/10.1007/978-981-99-9833-3_13