Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
From MaRDI portal
Publication:1643980
DOI10.1515/MATH-2018-0013zbMath1391.94779OpenAlexW2792813234WikidataQ130180421 ScholiaQ130180421MaRDI QIDQ1643980
Luis Panizo Alonso, David Yeregui Marcos del Blanco, Jose Angel Hermida Alonso
Publication date: 20 June 2018
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2018-0013
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A Homomorphic LWE Based E-voting Scheme
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Homomorphic Evaluation of the AES Circuit
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- Bootstrapping for HElib
- Defeating RSA Multiply-Always and Message Blinding Countermeasures
- BKZ 2.0: Better Lattice Security Estimates
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- On Ideal Lattices and Learning with Errors over Rings
- Coercion-Resistant Electronic Elections
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- A practical secret voting scheme for large scale elections
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Fully homomorphic encryption using ideal lattices
- How to Break MD5 and Other Hash Functions
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
