The following pages link to Delegation for bounded space (Q5495827):
Displaying 22 items.
- The hunting of the SNARK (Q1698394) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- Rational Sumchecks (Q2799100) (← links)
- Three-player entangled XOR games are NP-hard to approximate (Q2816299) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- A Hierarchy Theorem for Interactive Proofs of Proximity (Q4638092) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- (Q5090398) (← links)
- (Q5121905) (← links)
- Succinct delegation for low-space non-deterministic computation (Q5230332) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
- Adaptively sound zero-knowledge SNARKs for UP (Q6660292) (← links)
