Concurrent statistical zero-knowledge arguments for NP from one way functions

Abstract

In this paper we show a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Our transformation relies only on the existence of one-way functions. It is known that the existence of zeroknowledge systems for any non-trivial language implies one way functions. Hence our transformation unconditionally shows that concurrent statistical zero-knowledge arguments for a non-trivial language exist if and only if standalone secure statistical zero-knowledge arguments for that language exist. Further, applying our transformation to the recent statistical zeroknowledge argument system of Nguyen et al (STOC'06) yields the first concurrent statistical zero-knowledge argument system for all languages in NP from any one way function. © International Association for Cryptology Research 2007.