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

Authors:
Vipul Goyal;Ryan Moriarty;Rafail Ostrovsky;Amit Sahai
Affiliations:
University of California, Los Angeles;University of California, Los Angeles;University of California, Los Angeles;University of California, Los Angeles
Venue:
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Year:
2007

Citing 18
Cited 3

Does co-NP have short interactive proofs?

Information Processing Letters
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A discrete logarithm implementation of perfect zero-knowledge blobs

Journal of Cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Concurrent Zero Knowledge with Logarithmic Round-Complexity

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Zero knowledge with efficient provers

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Statistically-hiding commitment from any one-way function

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the concurrent composition of zero-knowledge proofs

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Simulatable commitments and efficient concurrent zero-knowledge

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Reducing complexity assumptions for statistically-hiding commitment

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent zero knowledge without complexity assumptions

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Black-Box Constructions of Two-Party Protocols from One-Way Functions

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Resettable statistical zero knowledge

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Languages with efficient zero-knowledge PCPs are in SZK

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

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 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 NP from any one way function.