The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization

DOI10.1007/978-3-540-78524-8_29zbMath1162.94392OpenAlexW1497819501MaRDI QIDQ5445524

Scott Yilek, Daniele Micciancio

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_29

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to construct constant-round zero-knowledge proof systems for NP
• The Knowledge Complexity of Interactive Proof Systems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Strict Polynomial-Time in Simulation and Extraction
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• On the Composition of Zero-Knowledge Proof Systems
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
• Theory of Cryptography
• Theory of Cryptography

This page was built for publication: The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization