Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

Authors:
Joe Kilian;Erez Petrank
Affiliations:
Yianilos Labs, NEC Research Institute;Dept. of Computer Science, Technion Israel Institute of Technology, Haifa 32000, Israel
Venue:
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Year:
2001

Citing 19
Cited 42

The knowledge complexity of interactive proof-systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Witness indistinguishable and witness hiding protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Constant-round perfect zero-knowledge computationally convincing protocols

Theoretical Computer Science
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Zero knowledge proofs of knowledge in two rounds

CRYPTO '89 Proceedings on Advances in cryptology
On the existence of statistically hiding bit commitment schemes and fail-stop signatures

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
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
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Lower Bounds for Zero Knowledge on the Internet

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Zero-knowledge with log-space verifiers

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On the concurrent composition of zero-knowledge proofs

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Concurrent zero-knowledge with timing, revisited

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Responsive Round Complexity and Concurrent Zero-Knowledge

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Bounded-concurrent secure two-party computation without setup assumptions

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
New notions of security: achieving universal composability without trusted setup

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Concurrent zero-knowledge

Journal of the ACM (JACM)
Foundations of cryptography: a primer

Foundations and Trends® in Theoretical Computer Science
Hybrid commitments and their applications to zero-knowledge proof systems

Theoretical Computer Science
Deniable Authentication on the Internet

Information Security and Cryptology
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Resettably Secure Computation

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Resettable zero-knowledge in the weak public-key model

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications 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
Strengthening zero-knowledge protocols using signatures

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Reduction zero-knowledge

SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Concurrent statistical zero-knowledge arguments for NP from one way functions

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Precise concurrent zero knowledge

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
The round-complexity of black-box zero-knowledge: a combinatorial characterization

TCC'08 Proceedings of the 5th conference on Theory of cryptography
On constant-round concurrent zero-knowledge

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Password-authenticated session-key generation on the internet in the plain model

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Concurrent non-malleable zero knowledge proofs

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Improved zero-knowledge identification with lattices

ProvSec'10 Proceedings of the 4th international conference on Provable security
Concurrent non-malleable zero knowledge with adaptive inputs

TCC'11 Proceedings of the 8th conference on Theory of cryptography
Limits of provable security from standard assumptions

Proceedings of the forty-third annual ACM symposium on Theory of computing
An efficient compiler from Σ-protocol to 2-move deniable zero-knowledge

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Single-prover concurrent zero knowledge in almost constant rounds

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Concurrent zero knowledge in the public-key model

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Eye for an eye: efficient concurrent zero-knowledge in the timing model

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Private coins versus public coins in zero-knowledge proof systems

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Relaxing environmental security: monitored functionalities and client-server computation

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Concurrent zero-knowledge with timing, revisited

Theoretical Computer Science
Concurrent zero knowledge without complexity assumptions

TCC'06 Proceedings of the Third conference on Theory of Cryptography
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
Simultaneously resettable arguments of knowledge

TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Concurrently secure computation in constant rounds

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the Composition of Public-Coin Zero-Knowledge Protocols

SIAM Journal on Computing
Nearly simultaneously resettable black-box zero knowledge

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Concurrent zero knowledge in the bounded player model

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Public-Coin concurrent zero-knowledge in the global hash model

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Non-black-box simulation in the fully concurrent setting

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A proof is concurrent zero-knowledge if it remains zero-knowledge when many copies of the proof are run in an asynchronous environment, such as the Internet. Richardson and Kilian have shown that there exists a concurrent zero-knowledge proof for any language in NP, but with round complexity polynomial in the maximum number of concurrent proofs. In this paper, we present a concurrent zero-knowledge proof for all languages in NP with a poly-logarithmic round complexity: specifically, &ohgr;(log^2 k) rounds given at most k concurrent proofs. Finally, we show that a simple modification of our proof is a resettable zero-knowledge proof for NP, with &ohgr;(log^2 k) rounds; previously known protocols required a polynomial number of rounds.