Definition and Construction of Multi-prover Zero-Knowledge Argument

Multi-prover zero-knowledge proof is an interesting proof in which a few provers synchronously prove validity of a statement to an verifier, however, the verifier will learn nothing beyond the fact that the statement is correct. We call multi-prover zero-knowledge proof as multi-prover zero-knowledge arguments if all provers are probabilistic polynomial-time participants. In this paper, we give the formal definition of multi-prover zero-knowledge argument and construct it based on discrete logarithm problem (DLP).