LaBRADOR: compact proofs for R1CS from Module-SIS
From MaRDI portal
Publication:6190148
DOI10.1007/978-3-031-38554-4_17OpenAlexW4385654123MaRDI QIDQ6190148
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38554-4_17
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- A compressed \(\varSigma \)-protocol theory for lattices
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Aurora: transparent succinct arguments for R1CS
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- New directions in nearest neighbor searching with applications to lattice sieving
- Thomas Clausen, Mathematiker und Astronom.
- New Techniques for Noninteractive Zero-Knowledge
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- The Accuracy of the Gaussian Approximation to the Sum of Independent Variates
- Ligero: lightweight sublinear arguments without a trusted setup
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Practical sublinear proofs for R1CS from lattices
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
This page was built for publication: LaBRADOR: compact proofs for R1CS from Module-SIS
