Concurrent Statistical Zero-Knowledge Arguments for NP from One-Way Functions

In this thesis 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 zero-knowledge 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 statistical zero-knowledge argument system of Nguyen. Ong and Vadhan (STOC'06) yields the first concurrent statistical zero-knowledge argument system for all languages in NP from any one-way function.