Pages that link to "Item:Q2120099"
From MaRDI portal
The following pages link to Proof-carrying data without succinct arguments (Q2120099):
Displayed 8 items.
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles (Q6061369) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
- Revisiting cycles of pairing-friendly elliptic curves (Q6186695) (← links)
- Algebraic reductions of knowledge (Q6190126) (← links)