## Abstract

Much of modern cryptography, starting from public-key encryption and going beyond, is based on the hardness of structured (mostly algebraic) problems like factoring, discrete log, or finding short lattice vectors. While structure is perhaps what enables advanced applications, it also puts the hardness of these problems in question. In particular, this structure often puts them in low (and so-called structured) complexity classes such as NP ∩ coNP or statistical zero-knowledge (SZK). Is this structure really necessary? For some cryptographic primitives, such as one-way permutations and homomorphic encryption, we know that the answer is yes-they imply hard problems in NP∩coNP and SZK, respectively. In contrast, one-way functions do not imply such hard problems, at least not by black-box reductions. Yet, for many basic primitives such as public-key encryption, oblivious transfer, and functional encryption, we do not have any answer. We show that the above primitives, and many others, do not imply hard problems in NP∩coNP or SZK via black-box reductions. In fact, we first show that even the very powerful notion of indistinguishability obfuscation (IO) does not imply such hard problems, and then deduce the same for a large class of primitives that can be constructed from IO.

Original language | English |
---|---|

Pages (from-to) | 98-144 |

Number of pages | 47 |

Journal | SIAM Journal on Computing |

Volume | 50 |

Issue number | 1 |

DOIs | |

State | Published - 2021 |

## Keywords

- Collision-resistant hashing
- Indistinguishability obfuscation
- NP ∩ coNP
- Statistical zero-knowledge
- Structured hardness

## All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Mathematics(all)