A one-round, two-prover, zero-knowledge protocol for NP
From MaRDI portal
Publication:1894702
DOI10.1007/BF01200756zbMath0834.94015OpenAlexW2030257803MaRDI QIDQ1894702
Publication date: 10 April 1996
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01200756
Extremal problems in graph theory (05C35) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Derandomized parallel repetition theorems for free games, Parallel Repetition of Two-Prover One-Round Games: An Exposition, Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs, REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM
Cites Work