On Interactive Proofs with a Laconic Prover
- 4 July 2001
- book chapter
- Published by Springer Nature
- p. 334-345
- https://doi.org/10.1007/3-540-48224-5_28
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On the Limits of Nonapproximability of Lattice ProblemsJournal of Computer and System Sciences, 2000
- Modern Cryptography, Probabilistic Proofs and PseudorandomnessPublished by Springer Nature ,1999
- On the complexity of interactive proofs with bounded communicationInformation Processing Letters, 1998
- Free Bits, PCPs, and Nonapproximability---Towards Tight ResultsSIAM Journal on Computing, 1998
- On resource-bounded measure and pseudorandomnessPublished by Springer Nature ,1997
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithmJournal of Cryptology, 1993
- Statistical zero-knowledge languages can be recognized in two roundsJournal of Computer and System Sciences, 1991
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987