a note on efficient zero-knowledge proofs and arguments (extended abstract)
In this note, we present new zero-knowledge interactive proofs and arguments for languages in NP . To show that x &egr; L , with an error probability of at most 2 - k , our zero-knowledge proof system requires O (| x | c 1 )+ O (lg c 2 | x |) k ideal bit commitments, where c 1 and c 2 depend only on L . This construction is the first in the ideal bit commitment model that achieves large values of k more efficiently than by running k independent iterations of the base interactive proof system. Under suitable complexity assumptions, we exhibit zero knowledge arguments that require O (lg c | x | kl bits of communication, where c depends only on L , and l is the security parameter for the prover. This is the first construction in which the total amount of communication can be less than that needed to transmit the NP witness. Our protocols are based on efficiently checkable proofs for NP [4].
efficiency knowledge argument abstraction interaction language errors probability systems commit model values iter complexity communication secure