A homomorphic LWE based E-voting scheme
From MaRDI portal
Publication:2802623
DOI10.1007/978-3-319-29360-8_16zbMATH Open1405.81024OpenAlexW2295939459MaRDI QIDQ2802623FDOQ2802623
Authors: Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, Malika Izabachène 
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
Recommendations
Cited In (17)
- A quantum safe analysis of Helios voting system
- Lattice-based proof of shuffle and applications to electronic voting
- Lattice-Based Proof of a Shuffle
- Improved lattice-based mix-nets for electronic voting
- TFHE: fast fully homomorphic encryption over the torus
- Post-quantum online voting scheme
- A practical multi-candidate voting protocol on quantum blockchain adapted for various Tally principles
- Deniable fully homomorphic encryption from learning with errors
- Extended tower number field sieve: a new complexity for the medium prime case
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices
- A new post-quantum voting protocol based on physical laws
- Somewhat/fully homomorphic encryption: implementation progresses and challenges
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
- Deniable cryptosystems: simpler constructions and achieving leakage resilience
This page was built for publication: A homomorphic LWE based E-voting scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802623)
