Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
From MaRDI portal
Publication:3000564
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; zbMATH DE number 94166
- Zero-Knowledge Proofs
- Zero‐Knowledge Proofs
- Efficient zero-knowledge proofs. (Abstract)
- On the communication complexity of zero-knowledge proofs
Cited In (23)
- On constructing one-way permutations from indistinguishability obfuscation
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Communication lower bounds of key-agreement protocols via density increment arguments
- Toward fine-grained blackbox separations between semantic and circular-security notions
- Towards non-black-box separations of public key encryption and one way function
- Limits on the power of indistinguishability obfuscation and functional encryption
- On constructing one-way permutations from indistinguishability obfuscation
- 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 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
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Perfect zero knowledge: new upperbounds and relativized separations
- Proofs of Work from worst-case assumptions
- On the complexity of collision resistant hash functions: new and old black-box separations
- A coin-free oracle-based augmented black box framework
- Limits on the power of garbling techniques for public-key encryption
- Structure versus hardness through the obfuscation lens
- 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
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)
