Statistical zero-knowledge languages can be recognized in two rounds
نویسندگان
چکیده
منابع مشابه
Statistical Zero-Knowledge Languages can be Recognized in Two Rounds
Recently, a hierarchy of probabilistic complexity classes generalizing NP has emerged in the work of Babai [B], and Goldwasser, Micali, and Racko [GMR1], and Goldwasser and Sipser [GS]. The class IP is de ned through the computational model of an interactive prover-veri er pair. Both Turing machines in a pair receive a common input and exchange messages. Every move of the veri er as well as its...
متن کاملConcurrent Zero-Knowledge in Poly-logarithmic Rounds
The subject of these notes is concurrent zero knowledge , in particular the construction given in [KP01]. Zero knowledgeness property of zero knowledge proof systems is defined with respect to an adversarial verifier that does not attempt to run multiple instances of a protocol concurrently. It is possible to prove that such protocols can be composed serially without substantial loss of securit...
متن کاملEverything in NP can be argued in per f ect zero - knowledge in a bounded number of rounds
A perfect zero-knowledge interactive protocol allows a prover to convince a verifier of the validity of a statement in a way that does not give the verifier any additional information [GMR, GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verifier. An important measure of efficiency for these protocols is the number of rounds in the interacti...
متن کاملEverything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract)
A perfect zero-knowledge interactive protocol allows a prover to convince a verifier of the validity of a statement in a way that does not give the verifier any additional information [GMR, GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verifier. An important measure of efficiency for these protocols is the number of rounds in the interacti...
متن کاملCan Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK
We extend the study of non-interactive statistical zeroknowledge proofs. Our main focus is to compare the class NISZK of problems possessing such non-interactive proofs to the class SZK of problems possessing interactive statistical zero-knowledge proofs. Along these lines, we first show that if statistical zero knowledge is non-trivial then so is non-interactive statistical zero knowledge, whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1991
ISSN: 0022-0000
DOI: 10.1016/0022-0000(91)90006-q