The complexity of perfect zero-knowledge

@inproceedings{citeulike:579929, abstract = {A Perfect Zero-Knowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses. This paper demonstrates that knowledge...}, author = {Fortnow, L. }, citeulike-article-id = {579929}, keywords = {szk}, pages = {204--209}, posted-at = {2006-04-07 22:47:32}, priority = {2}, title = {The complexity of perfect zero-knowledge}, url = {http://citeseer.ist.psu.edu/fortnow87complexity.html}, year = {1987} }

TY - CONF ID - citeulike:579929 L3 - citeulike-article-id:579929 TI - The complexity of perfect zero-knowledge SP - 204 EP - 209 N2 - A Perfect Zero-Knowledge interactive proof system convinces a verifier that a string is in a language without revealing any additional knowledge in an information-theoretic sense. We show that for any language that has a perfect zero-knowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zero-knowledge protocols for NP-complete languages unless the polynomial time hierarchy collapses. This paper demonstrates that knowledge... KW - szk AU - Fortnow, L PY - 1987/// UR - http://citeseer.ist.psu.edu/fortnow87complexity.html ER -