The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
From MaRDI portal
Publication:2914296
DOI10.1007/978-3-642-32009-5_41zbMath1296.94131OpenAlexW157767723MaRDI QIDQ2914296
Rafael Pass, Mohammad Mahmoody
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_41
zero-knowledge proofsblack-box separationsone-way functionsprogram checkershitting set generatorsnon-black-box constructionsnon-interactive commitments
Related Items
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 ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ Classical binding for quantum commitments ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ 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? ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ On Constructing One-Way Permutations from Indistinguishability Obfuscation ⋮ Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? ⋮ Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
This page was built for publication: The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
