Paper 2006/400
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
Vipul Goyal, Ryan Moriarty, 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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. ASIACRYPT 2007
- Keywords
- zero knowledge
- Contact author(s)
- vipul @ cs ucla edu
- History
- 2007-09-08: revised
- 2006-11-12: received
- See all versions
- Short URL
- https://ia.cr/2006/400
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/400,
author = {Vipul Goyal and Ryan Moriarty and Rafail Ostrovsky and Amit Sahai},
title = {Concurrent Statistical Zero-Knowledge Arguments for {NP} from One Way Functions},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/400},
year = {2006},
url = {https://eprint.iacr.org/2006/400}
}
