Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model under Standard Assumption

Authors:
Yi Deng;Dongdai Lin
Affiliations:
The state key laboratory of information security, Institute of software, Chinese Academy of sciences, Beijing, China 100080 and Graduate School of Chinese Academy of Sciences,;The state key laboratory of information security, Institute of software, Chinese Academy of sciences, Beijing, China 100080
Venue:
Information Security and Cryptology
Year:
2007

Citing 20
Cited 3

The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Witness indistinguishable and witness hiding protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Resettable zero-knowledge (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) 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
On Concurrent Zero-Knowledge with Pre-processing

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Soundness in the Public-Key Model

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Zero Knowledge Proofs of Knowledge in Two Rounds

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Universal Arguments and their Applications

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Resettably-Sound Zero-Knowledge and its Applications

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Concurrent Non-Malleable Commitments

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On monotone formula closure of SZK

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Efficient concurrent zero-knowledge in the auxiliary string model

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Concurrent zero knowledge in the public-key model

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Co-sound Zero-Knowledge with Public Keys

AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Resettable cryptography in constant rounds --- the case of zero knowledge

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the firstconstant round resettable zero knowledge arguments with concurrent soundness for $\mathcal{NP}$ in the bare public-key (BPK for short) model assuming only collision-resistant hash functions against polynomial-timeadversaries. This resolves the problem whether there exist such protocols for $\mathcal{NP}$ in BPK model without assuming sub-exponential hardness. In our protocol, the resettable zero knowledge is demonstrated via a black-box simulator, while the concurrent soundness is proved by using the malicious prover strategy in non-black-boxmanner.