A Homomorphic LWE Based E-voting Scheme

DOI10.1007/978-3-319-29360-8_16zbMath1405.81024OpenAlexW2295939459MaRDI QIDQ2802623

Mariya Georgieva, Malika Izabachène, Ilaria Chillotti, Nicolas Gama

Publication date: 26 April 2016

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29360-8_16

zbMATH Keywords

LWEfully homomorphic encryptionpost quantumE-votelattice based protocol

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Lattice-based proof of shuffle and applications to electronic voting, RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices, Deniable fully homomorphic encryption from learning with errors, Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm, Post-quantum online voting scheme, Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds, Lattice-Based Proof of a Shuffle, Somewhat/Fully Homomorphic Encryption: Implementation Progresses and Challenges, TFHE: fast fully homomorphic encryption over the torus, Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case, A new post-quantum voting protocol based on physical laws, Improved lattice-based mix-nets for electronic voting