Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
From MaRDI portal
Recommendations
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- More efficient amortization of exact zero-knowledge proofs for LWE
Cited in
(57)- Amortization with fewer equations for proving knowledge of small secrets
- New (and old) proof systems for lattice problems
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- Covert authentication from lattices
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- More efficient amortization of exact zero-knowledge proofs for LWE
- Asymptotically quasi-optimal cryptography
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice-based e-cash, revisited
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Short zero-knowledge proof of knowledge for lattice-based commitment
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Functional commitments for all functions, with transparent setup and from SIS
- A generic transform from multi-round interactive proof to NIZK
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Multimodal private signatures
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Lattice signature with efficient protocols, application to anonymous credentials
- A framework for practical anonymous credentials from lattices
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- Bicameral and auditably private signatures
- Fully dynamic attribute-based signatures for circuits from codes
- Ring/module learning with errors under linear leakage -- hardness and applications
- Two-round threshold signature from algebraic one-more learning with errors
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Generic construction of threshold ring signatures and lattice-based instantiations
- Two-round threshold signature from algebraic one-more learning with errors
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments
- Lova: lattice-based folding scheme from unstructured lattices
- \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems
- A note on short invertible ring elements and applications to cyclotomic and trinomials number fields
- Tanuki: new frameworks for (concurrently secure) blind signatures from post-quantum group actions
- Post-quantum blind signature from standard group action assumptions and more
- More efficient lattice-based electronic voting from NTRU
- Revisiting module lattice-based homomorphic encryption and application to secure-MPC
This page was built for publication: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2181849)
