A homomorphic LWE based E-voting scheme

Abstract : In this paper we present a new post-quantum electronic voting protocol. Our construction is based on LWE fully homomorphic encryption and the protocol is inspired by existing e-voting schemes, in particular Helios. The strengths of our scheme are its simplicity and transparency, since it relies on public homomorphic operations. Further-more, the use of lattice-based primitives greatly simplifies the proofs of correctness, privacy and verifiability, as no zero-knowledge proof are needed to prove the validity of individual ballots or the correctness of the final election result. The security of our scheme is based on classical SIS/LWE assumptions, which are asymptotically as hard as worst case lattice problems and relies on the random oracle heuristic. We also propose a new procedure to distribute the decryption task, where each trustee provides an independent proof of correct decryption in the form of a publicly verifiable cipher-text trapdoor. In particular, our protocol requires only two trustees, unlike classical proposals using threshold decryption via Shamir’s secret sharing.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01832761
Contributor : Léna Le Roy <>
Submitted on : Monday, July 9, 2018 - 8:20:31 AM
Last modification on : Wednesday, January 23, 2019 - 2:39:33 PM

Identifiers

Citation

I. Chillotti, N. Gama, M. Georgieva, M. Izabachène. A homomorphic LWE based E-voting scheme. Post-Quantum Cryptography. PQCrypto 2016. Lecture Notes in Computer Science, Feb 2016, Fukuoka, Japan. pp.245-265, ⟨10.1007/978-3-319-29360-8_16⟩. ⟨cea-01832761⟩

Share

Metrics

Record views

59