Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
Authors:
- Eli Ben-SassonEli Ben-Sasson
- Madars VirzaMVMadars Virza
- 24 December 2015
- book chapter
- Published by Springer Nature
- p. 33-64
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Polylogarithmic two-round argument systemsJournal of Mathematical Cryptology, 2008
- Short PCPs with Polylog Query ComplexitySIAM Journal on Computing, 2008
- The PCP theorem by gap amplificationJournal of the ACM, 2007
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- Probabilistic checking of proofsJournal of the ACM, 1998
- A one-round, two-prover, zero-knowledge protocol for NPCombinatorica, 1995
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- IP = PSPACEJournal of the ACM, 1992
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988