Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
The (true) complexity of statistical zero knowledge
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
SIAM Journal on Computing
Interactive hashing simplifies zero-knowledge protocol design
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Hi-index | 0.00 |
We show that any 3-round protocol (in general, any bounded round protocol) in which the verifier sends only random bits, and which is zero-knowledge against an honest verifier can be transformed into a protocol that is zero-knowledge in general. The transformation is based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung. No assumption is made on the computing power of prover or verifier, and the transformation therefore is valid in both the proof and argument model, and does not rely on any computational assumptions such as the existence of one-way permutations. The technique is also applicable to proofs of knowledge. The transformation preserves perfect and statistical zero-knowledge. As corollaries, we show first a generalization of a result by Damg氓rd on construction of bit-commitments from zero-knowledge proofs. Other corollaries give results on noninteractive zero-knowledge, one-sided proof systems, and black-box simulation.