In this paper we provide a new cryptographic primitive that generalize
s several existing zero-knowledge proofs and show that if a language L
induces the primitive, then there exists a perfect zero-knowledge pro
of for L. In addition, we present several kinds of languages inducing
the primitive, some of which are not known to have a perfect zero-know
ledge proof.