Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Interactive proof systems: Provers that never fail and random selection
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Simulatable commitments and efficient concurrent zero-knowledge
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
| Hi-index | 0.00 |
We introduce the notion of robust transformations of interactive proof systems. A robust transformation takes an interactive proof system (P, V), and produces a new interactive proof system, (P*, V*), such that the power of P* is within a polynomial factor of that of P. We show that, given an ideal protocol for secure circuit evaluation, there exists a robust transformation that converts interactive proof systems to zero-knowledge interactive proof systems.