Pages that link to "Item:Q2120099"
From MaRDI portal
The following pages link to Proof-carrying data without succinct arguments (Q2120099):
Displaying 12 items.
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Recursive composition and bootstrapping for SNARKS and proof-carrying data (Q5495781) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
- Protostar: generic efficient accumulation/folding for special-sound protocols (Q6562560) (← links)
- Folding schemes with selective verification (Q6619934) (← links)
- An efficient ZK compiler from SIMD circuits to general circuits (Q6655875) (← links)
- Mangrove: a scalable framework for folding-based SNARKs (Q6660304) (← links)
- HyperNova: recursive arguments for customizable constraint systems (Q6660305) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)