CryptoDB
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
| Authors: | |
|---|---|
| Download: | |
| 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. |
BibTeX
@misc{eprint-2006-21891,
title={Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions},
booktitle={IACR Eprint archive},
keywords={foundations / zero knowledge},
url={http://eprint.iacr.org/2006/400},
note={ASIACRYPT 2007 vipul@cs.ucla.edu 13764 received 9 Nov 2006, last revised 8 Sep 2007},
author={Vipul Goyal and Ryan Moriarty and Rafail Ostrovsky and Amit Sahai},
year=2006
}