Pages that link to "Item:Q2120097"
From MaRDI portal
The following pages link to \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097):
Displaying 14 items.
- ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines (Q5087274) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- PointProofs, revisited (Q6175975) (← links)
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments (Q6582225) (← links)
- From polynomial IOP and commitments to non-malleable zkSNARKs (Q6582227) (← links)
- Folding schemes with selective verification (Q6619934) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
- \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments (Q6639502) (← links)
- Functional commitments for arbitrary circuits of bounded sizes (Q6651898) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)