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

DOI10.1007/978-3-642-19571-6_34zbMath1290.94049OpenAlexW1485714558MaRDI QIDQ3000564

Gil Segev, Zvika Brakerski, Arkady Yerukhimovich, Jonathan N. 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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness ⋮ Limits on the Power of Indistinguishability Obfuscation and Functional Encryption ⋮ Towards Non-Black-Box Separations of Public Key Encryption and One Way Function ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Proofs of Work from worst-case assumptions ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ On constructing one-way permutations from indistinguishability obfuscation ⋮ On the impossibility of key agreements from quantum random oracles ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ On the complexity of compressing obfuscation ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ 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