LaBRADOR: compact proofs for R1CS from Module-SIS
From MaRDI portal
Recommendations
- Practical sublinear proofs for R1CS from lattices
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Aurora: transparent succinct arguments for R1CS
- Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
Cites work
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Aurora: transparent succinct arguments for R1CS
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 3043546 (Why is no real title available?)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Ligero: lightweight sublinear arguments without a trusted setup
- New directions in nearest neighbor searching with applications to lattice sieving
- New techniques for noninteractive zero-knowledge
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Practical product proofs for lattice commitments
- Practical sublinear proofs for R1CS from lattices
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- The Accuracy of the Gaussian Approximation to the Sum of Independent Variates
- Thomas Clausen, Mathematiker und Astronom.
Cited in
(30)- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Lattice-based threshold, accountable, and private signature
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Aggregating Falcon signatures with LaBRADOR
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- 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
- \textsf{Zinc}: succinct arguments with small arithmetization overheads from IOPs of proximity to the integers
- Designated-verifier SNARGs with one group element
- More efficient isogeny proofs of knowledge via canonical modular polynomials
- Unmasking \textsf{TRaccoon}: a lattice-based threshold signature with an efficient identifiable abort protocol
- T-Spoon: tightly secure two-round multi-signatures with key aggregation
- Blaze: fast SNARKs from interleaved RAA codes
- Efficient verifiable mixnets from lattices, revisited
- RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract)
- Lova: lattice-based folding scheme from unstructured lattices
- Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable
- Partial lattice trapdoors: how to split lattice trapdoors, literally
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Succinct line-point zero-knowledge arguments from homomorphic secret sharing
- Lattice EPID with efficient revocation
- Cyclo: lightweight lattice-based folding via partial range checks
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- More efficient lattice-based electronic voting from NTRU
- Hash-based multi-signatures for post-quantum Ethereum
- Anonymous reputation systems with revocation, revisited
- Tight reductions for SIS-with-hints assumptions with applications to anonymous credentials
- Batched \& non-interactive blind signatures from lattices
This page was built for publication: LaBRADOR: compact proofs for R1CS from Module-SIS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190148)
