More efficient lattice-based electronic voting from NTRU
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A homomorphic LWE based E-voting scheme
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing
- Actively secure setup for SPDZ
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- FINAL: faster FHE instantiated with NTRU and LWE
- Generalized Compact Knapsacks Are Collision Resistant
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Improved lattice-based mix-nets for electronic voting
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice signatures without trapdoors
- Lattice-based Cryptography
- Lattice-Based Proof of a Shuffle
- Lattice-based proof of shuffle and applications to electronic voting
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Making NTRU as secure as worst-case problems over ideal lattices
- More efficient amortization of exact zero-knowledge proofs for LWE
- More efficient commitments from structured lattice assumptions
- NTRU Fatigue: How Stretched is Overstretched?
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Revisiting Lattice Attacks on Overstretched NTRU Parameters
- Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Theory of Cryptography
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Worst-case to average-case reductions based on Gaussian measures
- Worst-case to average-case reductions for module lattices
This page was built for publication: More efficient lattice-based electronic voting from NTRU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326422)
