O. Goldreich and Y. Oren. De nitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology, Vol. 7, No. 1, pages 1-32, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Round Efficiency of Multi-Party Computation with a.. - Katz, Ostrovsky, Smith (Correct)
....executing n=2 copies of the proof system in parallel with independent provers; and (2) a witness extractor that can extract a witness for each proof from a malicious prover who is executing n=2 proofs in parallel with independent veri ers. Although not all ZKAKs satisfy both the above properties [25], the 5 round ZKAK of Feige and Shamir [19] which only requires one way functions) does. Chor and Rabin [13] proved that when the fx i g are commitments and the fw i g are the corresponding decommitments, their proof scheduling technique guarantees mutually independent commitments. However, to ....
O. Goldreich and Y. Oren. De nitions and properties of zero-knowledge proof systems. J. Cryptology, 7(1):1-32, 1994.
On the Existence of 3-Round Zero-Knowledge Proofs - Lepinski (2001) (Correct)
....is due in large part to the result by Goldreich, Micali and Wigderson[16] that there exists a zero knowledge proof system for any language in NP. Additionally, work has been done to determine the minimum number messages which must be exchanged in order to complete a zero knowledge proof ( 10] [13], 12] Of particular interest to us is a paper by Hada and Tanaka which provides a three round (three message) protocol for any language in NP which is proven to be zero knowledge given a set of strong assumptions. This is signi cant because it is known that no two round zero knowledge protocol ....
....is a paper by Hada and Tanaka which provides a three round (three message) protocol for any language in NP which is proven to be zero knowledge given a set of strong assumptions. This is signi cant because it is known that no two round zero knowledge protocol exists for any language outside BPP. [13] We present a three round zero knowledge proof system for any language in NP which is an improvement over the Hada Tanaka protocol in two important ways. First, our protocol is secure even the prover has unbounded resources. Second, we assume the hardness of the discrete logarithm problem for ....
[Article contains additional citation context not shown here]
O. Goldreich and Y. Oren. De nitions and properties of zero-knowledge proof systems. Journal of Cryptology, 6(3-4), 1993.
Magic Functions - Dwork, Naor, Reingold, Stockmeyer (1999) (4 citations) (Correct)
....conversations polynomial time indistinguishable from real prover veri er conversations; the simulator is an oracle machine S that interacts with the veri er V by submitting oracle queries to obtain the veri er s replies. The quanti cation order is: 9S 8V : In ordinary zero knowledge [19, 17], the order of quanti cation is reversed: 8V 9S : The question of the existence of 3 round ordinary zero knowledge proofs or arguments is unresolved: although it may be the case that the simulator can make use of the internals of V , it is not known how to exploit this information. ....
....over those D such that W (x; y) for every (x; y; z) that can be produced by D. Similarly, when we write 8x; y, it means 8x; y such that W (x; y) We begin the hierarchy using circuit family tests, because this was the choice made in the original paper [19] on zero knowledge (see also [17, 29]) Recall that S is an oracle machine in this de nition. De nition 4.1 (Black Box Zero Knowledge (over W ) 9S 8V 8x; y; z 8 dcf T j Pr[T ( P; V ) x; y; z) Pr[T (S (x; z) j (n) where the probabilities are over the coin ips of P , V and S. In the next de nition the simulator can ....
O. Goldreich and Y. Oren, De nitions and properties of zero-knowledge proof systems, J. Cryptology 6, 1993.
Universal Composition with Joint State - Canetti, Rabin (2002) (18 citations) (Correct)
....all , all the round messages from all the instances are sent and received together. Concurrent composition allows the messages of the various protocol instances to be delivered in an adversarially determined order. In the context of Zero Knowledge protocols, these operations are considered in [go94, gk88, dns98] In the context of multiparty function evaluation, sequential composition is considered in [b91] A di erent (and ultimately more general) composition operation, called reducibility and later modular composition, regards protocols as subroutines of other protocols. Here one starts ....
O. Goldreich and Y. Oren, \De nitions and properties of Zero-Knowledge proof systems", Journal of Cryptology, Vol. 7, No. 1, Springer-Verlag, 1994, pp. 1-32. Preliminary version by Y. Oren in 28th Symp. on Foundations of Computer Science (FOCS), IEEE, 1987.
Foundations of Cryptography - Goldreich (2004) (50 citations) Self-citation (Goldreich) (Correct)
No context found.
O. Goldreich and Y. Oren. De nitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology, Vol. 7, No. 1, pages 1-32, 1994.
Round Efficiency of Multi-Party Computation with a.. - Katz, Ostrovsky, Smith (2003) (Correct)
No context found.
O. Goldreich and Y. Oren. De nitions and properties of zero-knowledge proof systems. J. Cryptology, 7(1):1-32, 1994.
A Note on Constant-Round Zero-Knowledge Proofs for NP - Rosen (Correct)
No context found.
O. Goldreich and Y. Oren. De nitions and Properties of Zero-Knowledge Proof Systems. Jour. of Cryptology, Vol. 7, No. 1, pages 1-32, 1994.
Concurrent Zero-Knowledge Proofs for NP - Kilian, Petrank, Richardson (2001) (1 citation) (Correct)
No context found.
Oded Goldreich and Yair Oren. De nitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1-32, Winter 1994.
A Complete Problem for Statistical Zero Knowledge - Sahai, Vadhan (2002) (Correct)
No context found.
Oded Goldreich and Yair Oren. De nitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1-32, Winter 1994.
Efficient and Concurrent Zero-Knowledge from any public.. - Micciancio, Petrank (Correct)
No context found.
Oded Goldreich and Yair Oren. De nitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1-32, Winter 1994.
Efficient and Concurrent Zero-Knowledge from any public.. - Micciancio, Petrank (2002) (Correct)
No context found.
Oded Goldreich and Yair Oren. De nitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1-32, Winter 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC