Statistical Zero-Knowledge Languages can be Recognized in Two Rounds

by: William Aiello, Johan Hastad

Journal of Computer and System Sciences, Vol. 42, No. 3. (1991), pp. 327-345.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

geomblog

Find related articles with these CiteULike tags

Abstract

Recently, a hierarchy of probabilistic complexity classes generalizing NP has emerged in the work of Babai [B], and Goldwasser, Micali, and Rackoff [GMR1], and Goldwasser and Sipser [GS]. The class IP is defined through the computational model of an interactive prover-verifier pair. Both Turing machines in a pair receive a common input and exchange messages. Every move of the verifier as well as its final determination of whether to accept or reject w are the result of random polynomial time...

@article{citeulike:579928, abstract = {Recently, a hierarchy of probabilistic complexity classes generalizing NP has emerged in the work of Babai [B], and Goldwasser, Micali, and Rackoff [GMR1], and Goldwasser and Sipser [GS]. The class IP is defined through the computational model of an interactive prover-verifier pair. Both Turing machines in a pair receive a common input and exchange messages. Every move of the verifier as well as its final determination of whether to accept or reject w are the result of random polynomial time...}, author = {Aiello, William and Hastad, Johan }, citeulike-article-id = {579928}, journal = {Journal of Computer and System Sciences}, keywords = {szk}, number = {3}, pages = {327--345}, posted-at = {2006-04-07 22:46:13}, priority = {2}, title = {Statistical Zero-Knowledge Languages can be Recognized in Two Rounds}, url = {http://citeseer.ist.psu.edu/aiello91statistical.html}, volume = {42}, year = {1991} }

RIS record

TY - JOUR ID - citeulike:579928 L3 - citeulike-article-id:579928 TI - Statistical Zero-Knowledge Languages can be Recognized in Two Rounds JF - Journal of Computer and System Sciences VL - 42 IS - 3 SP - 327 EP - 345 N2 - Recently, a hierarchy of probabilistic complexity classes generalizing NP has emerged in the work of Babai [B], and Goldwasser, Micali, and Rackoff [GMR1], and Goldwasser and Sipser [GS]. The class IP is defined through the computational model of an interactive prover-verifier pair. Both Turing machines in a pair receive a common input and exchange messages. Every move of the verifier as well as its final determination of whether to accept or reject w are the result of random polynomial time... KW - szk AU - Aiello, William AU - Hastad, Johan PY - 1991/// UR - http://citeseer.ist.psu.edu/aiello91statistical.html ER -

RIS BibTeX