Statistical zero-knowledge languages can be recognized in two rounds
- 1 June 1991
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 42 (3) , 327-345
- https://doi.org/10.1016/0022-0000(91)90006-q
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the power of interactionCombinatorica, 1990
- Everything Provable is Provable in Zero-KnowledgePublished by Springer Nature ,1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Direct Minimum-Knowledge Computations (Extended Abstract)Published by Springer Nature ,1988
- Random self-reducibility and zero knowledge interactive proofs of possession of informationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- A complexity theoretic approach to randomnessPublished by Association for Computing Machinery (ACM) ,1983
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979