We prove a number of general theorems about ZK, the class of problems possessing ( computational) zero-knowledge proofs. Our results are unconditional, in contrast to most previous works on ZK, which rely on the assumption ...