Pages that link to "Item:Q1894702"
From MaRDI portal
The following pages link to A one-round, two-prover, zero-knowledge protocol for NP (Q1894702):
Displaying 8 items.
- Derandomized parallel repetition theorems for free games (Q371195) (← links)
- Fully parallelized multi-prover protocols for NEXP-time (Q1356878) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- Two prover protocols, low error at affordable rates (Q2817609) (← links)
- Parallel Repetition of Two-Prover One-Round Games: An Exposition (Q5135260) (← links)
- REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM (Q5249275) (← links)