Improved lattice-based mix-nets for electronic voting
From MaRDI portal
Publication:2104424
Recommendations
Cites work
- A homomorphic LWE based E-voting scheme
- Computationally binding quantum commitments
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Lattice-Based Proof of a Shuffle
- Lattice-based proof of shuffle and applications to electronic voting
- More efficient commitments from structured lattice assumptions
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- On ideal lattices and learning with errors over rings
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Practical product proofs for lattice commitments
- Progress in Cryptology - INDOCRYPT 2004
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Revisiting post-quantum Fiat-Shamir
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Theory of Cryptography
- cuHE
- cuHE: a homomorphic encryption accelerator library
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)