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

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.