Multi-prover interactive proofs: how to remove intractability
Michael Ben-Or, Shafi Goldwasser, Joe Kilian, Avi Widgerson · 1988
Quite complex cryptographic machinery has been developed based on the assumption that one-way functions exist, yet we know of only a few possible such candidates. It is important at this time to find alternative foundations to the design of secure cryptography. We introduce a new model of generalized interactive proofs as a step in this direction. We prove that all NP languages have perfect zero-knowledge proof-systems in this model, without making any intractability assumptions.