Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

DOI10.1007/978-3-642-19571-6_34zbMATH Open1290.94049OpenAlexW1485714558MaRDI QIDQ3000564FDOQ3000564

Authors: Zvika Brakerski, Gil Segev, Arkady Yerukhimovich, Jonathan Katz 

Publication date: 19 May 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-19571-6_34

Recommendations

• scientific article
• Limits of Constructive Security Proofs
• Impossibility and Feasibility Results for Zero Knowledge with Public Keys
• Zero knowledge with efficient provers
• scientific article; zbMATH DE number 1107670
• scientific article
• Zero-Knowledge Proofs
• Zero‐Knowledge Proofs
• Efficient zero-knowledge proofs. (Abstract)
• On the communication complexity of zero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (20)

• On constructing one-way permutations from indistinguishability obfuscation
• Communication lower bounds of key-agreement protocols via density increment arguments
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
• Structure Versus Hardness Through the Obfuscation Lens
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• On the complexity of compressing obfuscation
• On Constructing One-Way Permutations from Indistinguishability Obfuscation
• On black-box extension of a non-interactive zero-knowledge proof system for secret equality
• On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
• Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Perfect zero knowledge: new upperbounds and relativized separations
• Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
• Proofs of Work from worst-case assumptions
• On the complexity of collision resistant hash functions: new and old black-box separations
• How (not) to build quantum PKE in Minicrypt
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Limits of Constructive Security Proofs
• On the impossibility of key agreements from quantum random oracles
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions

This page was built for publication: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

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