Pages that link to "Item:Q6104330"
From MaRDI portal
The following pages link to Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330):
Displayed 10 items.
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Succinct vector, polynomial, and functional commitments from lattices (Q6063525) (← links)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification (Q6145785) (← links)
- A framework for practical anonymous credentials from lattices (Q6145919) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Non-interactive zero-knowledge from non-interactive batch arguments (Q6186697) (← links)
- Lattice-based succinct arguments from vanishing polynomials (extended abstract) (Q6186698) (← links)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices (Q6186699) (← links)
- LaBRADOR: compact proofs for R1CS from Module-SIS (Q6190148) (← links)