Improved lattice-based mix-nets for electronic voting
From MaRDI portal
Publication:2104424
DOI10.1007/978-3-031-08896-4_6OpenAlexW3214377493MaRDI QIDQ2104424FDOQ2104424
Authors: Valeh Farzaliyev, Jan Willemson, Jaan Kristjan Kaasik
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08896-4_6
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)
Cites Work
- cuHE
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On ideal lattices and learning with errors over rings
- Theory of Cryptography
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- More efficient commitments from structured lattice assumptions
- Practical product proofs for lattice commitments
- A homomorphic LWE based E-voting scheme
- Lattice-Based Proof of a Shuffle
- Lattice-based proof of shuffle and applications to electronic voting
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Computationally binding quantum commitments
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- cuHE: a homomorphic encryption accelerator library
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Revisiting post-quantum Fiat-Shamir
- Progress in Cryptology - INDOCRYPT 2004
Uses Software
This page was built for publication: Improved lattice-based mix-nets for electronic voting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104424)