Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
From MaRDI portal
Recommendations
- New (and old) proof systems for lattice problems
- Practical sublinear proofs for R1CS from lattices
- Doubly efficient interactive proofs over infinite and non-commutative rings
- Proof mining and effective bounds in differential polynomial rings
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Proof systems for lattice theory
- Lattices Over Algebraic Integers With an Application to Compute-and-Forward
- A lattice-theoretic approach to the Bourque-Ligh conjecture
- A new proof of the congruence lattice representation theorem
- An algorithmic proof of Suslin's stability theorem for polynomial rings
Cites work
- A new identification scheme based on syndrome decoding
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- An improved compression technique for signatures based on learning with errors
- Aurora: transparent succinct arguments for R1CS
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Lattice signatures without trapdoors
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Lattice-based zero-knowledge arguments for integer relations
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- More efficient commitments from structured lattice assumptions
- On ideal lattices and learning with errors over rings
- Practical product proofs for lattice commitments
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Theory of Cryptography
- Universally composable two-party and multi-party secure computation
- Worst-case to average-case reductions for module lattices
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
Cited in
(50)- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- Covert authentication from lattices
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Practical post-quantum few-time verifiable random function with applications to Algorand
- More efficient amortization of exact zero-knowledge proofs for LWE
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- A generic transform from multi-round interactive proof to NIZK
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Practical sublinear proofs for R1CS from lattices
- 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)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Bicameral and auditably private signatures
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Fully dynamic attribute-based signatures for circuits from codes
- Ring/module learning with errors under linear leakage -- hardness and applications
- On structure-preserving cryptography and lattices
- Two-round threshold signature from algebraic one-more learning with errors
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Greyhound: fast polynomial commitments from lattices
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- Post-quantum lattice-based e-voting for multiple candidates
- Generic construction of threshold ring signatures and lattice-based instantiations
- Two-round threshold signature from algebraic one-more learning with errors
- Threshold computation in the head: improved framework for post-quantum signatures and zero-knowledge arguments
- The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- Cryptographic group action-based compact adaptor signature with full extractability, unlinkability and witness hiding
- Title not available (Why is no real title available?)
This page was built for publication: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692384)
