Locally random reductions: Improvements and applications
- 1 December 1997
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Cryptology
- Vol. 10 (1), 17-36
- https://doi.org/10.1007/s001459900017
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Locally random reductions in interactive complexity theoryDIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1993
- On the power of two-local random reductionsInformation Processing Letters, 1992
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- IP = PSPACEJournal of the ACM, 1992
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Everything Provable is Provable in Zero-KnowledgeLecture Notes in Computer Science, 1990
- Hiding instances in multioracle queriesLecture Notes in Computer Science, 1990
- On hiding information from an oracleJournal of Computer and System Sciences, 1989
- Direct Minimum-Knowledge Computations (Extended Abstract)Lecture Notes in Computer Science, 1988