A note on constant-round concurrent zero-knowledge arguments of knowledge for NP

Authors:
Hongda Li;Yang Liu;Qihua Niu
Affiliations:
State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China;State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China
Venue:
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Year:
2012

Citing 12
Cited 0

The knowledge complexity of interactive proof systems

SIAM Journal on Computing
On the Composition of Zero-Knowledge Proof Systems

SIAM Journal on Computing
Concurrent zero-knowledge

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Strict polynomial-time in simulation and extraction

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Zero Knowledge Proofs of Knowledge in Two Rounds

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Lower Bounds for Non-Black-Box Zero Knowledge

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
New and improved constructions of non-malleable cryptographic protocols

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lower bounds for non-black-box zero knowledge

Journal of Computer and System Sciences - Special issue on FOCS 2003
Multiple non-interactive zero knowledge proofs based on a single random string

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Round-optimal zero-knowledge arguments based on any one-way function

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with how to construct a constant-round bounded-concurrent zero-knowledge argument of knowledge with black-box extractors for any NP language under standard complexity assumptions. It is accepted that both constant-round zero-knowledge arguments of knowledge and constant-round bound-concurrent zero-knowledge arguments exist for all NP. But the existence of constant-round bounded-concurrent zero-knowledge arguments of knowledge (with black-box extractors) for NP is still an unsolved question. In this paper, we give a positive answer to this question by constructing a constant-round bounded-concurrent zero-knowledge argument of knowledge with a black-box extractor for any NP under certain standard complexity assumptions.