Greyhound: fast polynomial commitments from lattices
From MaRDI portal
Publication:6660299
DOI10.1007/978-3-031-68403-6_8MaRDI QIDQ6660299
Ngoc Khanh Nguyen, Gregor Seiler
Publication date: 10 January 2025
Cites Work
- Title not available (Why is that?)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- Time- and space-efficient arguments from groups of unknown order
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Worst-case to average-case reductions for module lattices
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Constant-Size Commitments to Polynomials and Their Applications
- Modular exponentiation via the explicit Chinese remainder theorem
- Lattice-based Cryptography
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Asynchronous Computational VSS with Reduced Communication Complexity
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Private polynomial commitments and applications to MPC
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Fiat-Shamir transformation of multi-round interactive proofs
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Chainable functional commitments for unbounded-depth circuits
- Lattice-based functional commitments: fast verification and cryptanalysis
This page was built for publication: Greyhound: fast polynomial commitments from lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660299)
