Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
STOC '01 Proceedings of the thirty-third 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
2-round zero knowledge and proof auditors
STOC '02 Proceedings of the thiry-fourth 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
On the composition of authenticated byzantine agreement
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Untraceable off-line electronic cash flow in e-commerce
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Sequential composition of protocols without simultaneous termination
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Note on the Round-Complexity of Concurrent Zero-Knowledge
CRYPTO '00 Proceedings of the 20th 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
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Min-round Resettable Zero-Knowledge in the Public-Key Model
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Zero-Knowledge and Code Obfuscation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Note on Security Proofs in the Generic Model
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances 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
A Relationship between One-Wayness and Correlation Intractability
PKC '99 Proceedings of the Second International Workshop on Practice and Theory in Public Key Cryptography
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Magic Functions: In Memoriam: Bernard M. Dwork 1923--1998
Journal of the ACM (JACM)
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The random oracle methodology, revisited
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
ACM SIGACT news distributed computing column 24
ACM SIGACT News
On the composition of authenticated Byzantine Agreement
Journal of the ACM (JACM)
An efficient parallel repetition theorem for Arthur-Merlin games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Adaptive One-Way Functions and Applications
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
PEREA: towards practical TTP-free revocation in anonymous authentication
Proceedings of the 15th ACM conference on Computer and communications security
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
TCC '09 Proceedings of the 6th Theory of Cryptography 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
Zero-Knowledge Proofs with Witness Elimination
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Efficient Concurrent npoly(logn)-Simulatable Argument of Knowledge
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
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
Proceedings of the forty-first annual ACM symposium on Theory of computing
Zero Knowledge in the Random Oracle Model, Revisited
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
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
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Parallel repetition of computationally sound protocols revisited
TCC'07 Proceedings of the 4th conference on Theory of cryptography
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the limitations of universally composable two-party computation without set-up assumptions
EUROCRYPT'03 Proceedings of the 22nd international conference on 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
Simulation in quasi-polynomial time, and its application to protocol composition
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Obtaining universally compoable security: towards the bare bones of trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Which languages have 4-round zero-knowledge proofs?
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An equivalence between zero knowledge and commitments
TCC'08 Proceedings of the 5th conference on Theory of cryptography
The round-complexity of black-box zero-knowledge: a combinatorial characterization
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the round complexity of zero-knowledge proofs based on one-way permutations
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Towards non-black-box lower bounds in cryptography
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
PEREA: Practical TTP-free revocation of repeatedly misbehaving anonymous users
ACM Transactions on Information and System Security (TISSEC)
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
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
Concurrent zero knowledge in the public-key model
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Composition of zero-knowledge proofs with efficient provers
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
Handling expected polynomial-time strategies in simulation-based security proofs
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Impossibility and feasibility results for zero knowledge with public keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On the impossibility of three-move blind signature schemes
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Constant-Round non-malleable commitments from sub-exponential one-way functions
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Interactive zero-knowledge with restricted random oracles
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient zero-knowledge arguments from two-tiered homomorphic commitments
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Point obfuscation and 3-round zero-knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
The knowledge tightness of parallel zero-knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Standard security does not imply security against selective-opening
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
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Round-optimal black-box statistically binding selective-opening secure commitments
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
A note on constant-round concurrent zero-knowledge arguments of knowledge for NP
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Public-Coin concurrent zero-knowledge in the global hash model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the impossibility of approximate obfuscation and applications to resettable cryptography
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
The wide applicability of zero-knowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zero-knowledge protocols is zero-knowledge too. We demonstrate the limitations of the composition of zero-knowledge protocols by proving that the original definition of zero-knowledge is not closed under sequential composition; and that even the strong formulations of zero-knowledge (e.g., black-box simulation) are not closed under parallel execution. We present lower bounds on the round complexity of zero-knowledge proofs, with significant implications for the parallelization of zero-knowledge protocols. We prove that three-round interactive proofs and constant-round Arthur--Merlin proofs that are black-box simulation zero-knowledge exist only for languages in BPP. In particular, it follows that the "parallel versions" of the first interactive proofs systems presented for quadratic residuosity, graph isomorphism, and any language in NP, are not black-box simulation zero-knowledge, unless the corresponding languages are in BPP. Whether these parallel versions constitute zero-knowledge proofs was an intriguing open questions arising from the early works on zero-knowledge. Other consequences are a proof of optimality for the round complexity of various known zero-knowledge protocols and the necessity of using secret coins in the design of "parallelizable" constant-round zero-knowledge proofs.