Cryptology ePrint Archive: Report 2006/400

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

Vipul Goyal and Ryan Moriarty and Rafail Ostrovsky and Amit Sahai

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 zero-knowledge systems for any non-trivial language implies one way functions. Hence our transformation \emph{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 zero-knowledge argument system of Nguyen et al (STOC'06) yields the first concurrent statistical zero-knowledge argument system for all languages in \textbf{NP} from any one way function.

Category / Keywords: foundations / zero knowledge

Publication Info: ASIACRYPT 2007

Date: received 9 Nov 2006, last revised 8 Sep 2007

Contact author: vipul at cs ucla edu

Available format(s): PDF | BibTeX Citation

Version: 20070908:064917 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]