The following pages link to (Q5121910):
Displaying 7 items.
- Simplified small exponent test for batch verification (Q501674) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Strong batching for non-interactive statistical zero-knowledge (Q6637570) (← links)
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions (Q6660291) (← links)