On Efficient Zero-Knowledge PCPs
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 151-168
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- On basing one-way functions on NP-hardness2006
- On Worst‐Case to Average‐Case Reductions for NP ProblemsSIAM Journal on Computing, 2006
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- Statistical zero-knowledge languages can be recognized in two roundsJournal of Computer and System Sciences, 1991
- Checking computations in polylogarithmic time1991
- Everything Provable is Provable in Zero-Knowledge1990
- Multi-prover interactive proofs: how to remove intractability1988
- Non-interactive zero-knowledge and its applications1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987