Pages that link to "Item:Q4997311"
From MaRDI portal
The following pages link to Constant-Round Interactive Proofs for Delegating Computation (Q4997311):
Displaying 5 items.
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification (Q6139835) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
