Aiello, W., and J. Hastad, "Relativized Perfect Zero-Knowledge is not BPP", Information and Computation, Vol. 93, 1992, pp. 223-240.

 Home/Search   Document Details and Download   Summary   Related Articles  

This paper is cited in the following contexts:
Definitions And Properties Of Zero-Knowledge Proof Systems - Goldreich, Oren (1994)   (34 citations)  (Correct)

....proof systems, so is the non triviality of the interaction. It can be easily shown that only languages in BPP can have 1 step interactive proofs which are zero knowledge. We show that the same holds for 2 step zero knowledge proof systems under the auxiliaryinput definition. Aiello and Hastad [AH2] proved that, relative to some oracle A, 2 Gamma StepZero Gamma Knowledge . Their proof hold for the original [GMR1] definition (actually for a stronger definition, see [AH2] The proof presents a 2 step protocol which is a zero knowledge interactive proof system for some language LA , but ....

....that the same holds for 2 step zero knowledge proof systems under the auxiliaryinput definition. Aiello and Hastad [AH2] proved that, relative to some oracle A, 2 Gamma StepZero Gamma Knowledge . Their proof hold for the original [GMR1] definition (actually for a stronger definition, see [AH2]) The proof presents a 2 step protocol which is a zero knowledge interactive proof system for some language LA , but such that LA = 2 BPP . Since the prover in the protocol is deterministic, the result can also be interpreted as Deterministic Gamma P roverZero Gamma Knowledge . Our ....

[Article contains additional citation context not shown here]

Aiello, W., and J. Hastad, "Relativized Perfect Zero-Knowledge is not BPP", Information and Computation, Vol. 93, 1992, pp. 223-240.

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