The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
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
Journal of the ACM (JACM)
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
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Bit Commitment Using Pseudo-Randomness
CRYPTO '89 Proceedings of the 9th 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
Identification Tokens - or: Solving the Chess Grandmaster Problem
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
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
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On the cunning power of cheating verifiers: Some observations about zero knowledge proofs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
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
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
Sequential composition of protocols without simultaneous termination
Proceedings of the twenty-first annual symposium on Principles of distributed computing
On Concurrent Zero-Knowledge with Pre-processing
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
Session-Key Generation Using Human Passwords Only
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
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
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Bounded-concurrent secure multi-party computation with a dishonest majority
STOC '04 Proceedings of the thirty-sixth 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
Journal of the ACM (JACM)
Concurrent general composition of secure protocols in the timing model
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth 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
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)
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science
An efficient parallel repetition theorem for Arthur-Merlin games
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deniable Authentication on the Internet
Information Security and Cryptology
Composability and On-Line Deniability of Authentication
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
Local Sequentiality Does Not Help for Concurrent Composition
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
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
Simulatable commitments and efficient concurrent zero-knowledge
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
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
Concurrent non-malleable zero knowledge proofs
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Limits of provable security from standard assumptions
Proceedings of the forty-third annual ACM symposium on Theory of computing
On constant-round concurrent non-malleable proof systems
Information Processing Letters
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
Efficiency preserving transformations for concurrent non-malleable zero knowledge
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
Constant-Round concurrent non-malleable statistically binding commitments and decommitments
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key 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
Concurrently secure computation in constant rounds
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On round-optimal zero knowledge in the bare public-key model
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
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
Concurrent non-malleable witness indistinguishable argument from any one-way function
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
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
On the impossibility of approximate obfuscation and applications to resettable cryptography
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge proofs with one or multiple verifiers. Under this type of composition it is believed that standard zero-knowledge protocols are no longer zero-knowledge. We show that, modulo certain complexity assumptions, any statement in NP has kƐ-round proofs and arguments in which one can efficiently simulate any kO(1) concurrent executions of the protocol.