Published 1987 in Structure in Complexity Theory Conference

A Perfect Zero-Knowledge interactive proof system convinces a veriier 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â€¦Â CONTINUE READING