Pages that link to "Item:Q4997311"
From MaRDI portal
The following pages link to Constant-Round Interactive Proofs for Delegating Computation (Q4997311):
Displaying 9 items.
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Non-interactive publicly-verifiable delegation of committed programs (Q6067380) (← links)
- Nearly optimal property preserving hashing (Q6108992) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification (Q6145785) (← links)
- Faster sounder succinct arguments and \textsf{IOP}s (Q6155264) (← links)
- Succinct interactive oracle proofs: applications and limitations (Q6155266) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)