eng
Schloss Dagstuhl β Leibniz-Zentrum fΓΌr Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-02-04
47:1
47:20
10.4230/LIPIcs.ITCS.2021.47
article
Black-Box Uselessness: Composing Separations in Cryptography
Couteau, Geoffroy
1
https://orcid.org/0000-0002-6645-0106
Farshim, Pooya
2
https://orcid.org/0000-0003-2746-3585
Mahmoody, Mohammad
3
https://orcid.org/0000-0002-6839-4697
CNRS, IRIF, UniversitΓ© de Paris, France
Department of Computer Science, University of York, UK
Department of Computer Science, University of Virginia, Charlottesville, VA, USA
Black-box separations have been successfully used to identify the limits of a powerful set of tools in cryptography, namely those of black-box reductions. They allow proving that a large set of techniques are not capable of basing one primitive π« on another π¬. Such separations, however, do not say anything about the power of the combination of primitives π¬β,π¬β for constructing π«, even if π« cannot be based on π¬β or π¬β alone.
By introducing and formalizing the notion of black-box uselessness, we develop a framework that allows us to make such conclusions. At an informal level, we call primitive π¬ black-box useless (BBU) for π« if π¬ cannot help constructing π« in a black-box way, even in the presence of another primitive π΅. This is formalized by saying that π¬ is BBU for π« if for any auxiliary primitive π΅, whenever there exists a black-box construction of π« from (π¬,π΅), then there must already also exist a black-box construction of π« from π΅ alone. We also formalize various other notions of black-box uselessness, and consider in particular the setting of efficient black-box constructions when the number of queries to π¬ is below a threshold.
Impagliazzo and Rudich (STOC'89) initiated the study of black-box separations by separating key agreement from one-way functions. We prove a number of initial results in this direction, which indicate that one-way functions are perhaps also black-box useless for key agreement. In particular, we show that OWFs are black-box useless in any construction of key agreement in either of the following settings: (1) the key agreement has perfect correctness and one of the parties calls the OWF a constant number of times; (2) the key agreement consists of a single round of interaction (as in Merkle-type protocols). We conjecture that OWFs are indeed black-box useless for general key agreement.
We also show that certain techniques for proving black-box separations can be lifted to the uselessness regime. In particular, we show that the lower bounds of Canetti, Kalai, and Paneth (TCC'15) as well as Garg, Mahmoody, and Mohammed (Crypto'17 & TCC'17) for assumptions behind indistinguishability obfuscation (IO) can be extended to derive black-box uselessness of a variety of primitives for obtaining (approximately correct) IO. These results follow the so-called "compiling out" technique, which we prove to imply black-box uselessness.
Eventually, we study the complementary landscape of black-box uselessness, namely black-box helpfulness. We put forth the conjecture that one-way functions are black-box helpful for building collision-resistant hash functions. We define two natural relaxations of this conjecture, and prove that both of these conjectures are implied by a natural conjecture regarding random permutations equipped with a collision finder oracle, as defined by Simon (Eurocrypt'98). This conjecture may also be of interest in other contexts, such as amplification of hardness.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol185-itcs2021/LIPIcs.ITCS.2021.47/LIPIcs.ITCS.2021.47.pdf
Black-Box Reductions
Separations
One-Way Functions
Key Agreement