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

DOI10.1007/978-3-540-78524-8_29MaRDI QIDQ5445524zbMATH OpenOpenAlexFDO

Authors Daniele Micciancio, Scott Yilek

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)

Recommendations

• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• scientific article; zbMATH DE number 1759795
• On the round complexity of zero-knowledge proofs based on one-way permutations

Cites work

• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• How to construct constant-round zero-knowledge proof systems for NP
• scientific article; zbMATH DE number 1304087 (Why is no real title available?)
• scientific article; zbMATH DE number 1759795 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• On the Composition of Zero-Knowledge 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
• The Knowledge Complexity of Interactive Proof Systems
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
• Theory of Cryptography
• Theory of Cryptography

Cited in

(8)

• Round optimal black-box ``commit-and-prove
• A black-box approach to post-quantum zero-knowledge in constant rounds
• On black-box complexity of universally composable security in the CRS model
• The round complexity of quantum zero-knowledge
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• On Black-Box Complexity of Universally Composable Security in the CRS Model
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445524)