One-way functions vs. TFNP: Simpler and improved

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00582267" target="_blank" >RIV/67985840:_____/24:00582267 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.4230/LIPIcs.ITCS.2024.50" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.ITCS.2024.50</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.ITCS.2024.50" target="_blank" >10.4230/LIPIcs.ITCS.2024.50</a>

Result language

angličtina

Original language name

One-way functions vs. TFNP: Simpler and improved

Original language description

Simon (1998) proved that it is impossible to construct collision-resistant hash functions from one-way functions using a black-box reduction. It is conjectured more generally that one-way functions do not imply, via a black-box reduction, the hardness of any total NP search problem (collision-resistant hash functions being just one such example). We make progress towards this conjecture by ruling out a large class of 'single-query' reductions. In particular, we improve over the prior work of Hubáček et al. (2020) in two ways: our result is established via a novel simpler combinatorial technique and applies to a broader class of semi black-box reductions.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2024

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

15th Innovations in Theoretical Computer Science Conference (ITCS 2024)

ISBN

978-3-95977-309-6

ISSN

—

e-ISSN

—

Number of pages

14

Pages from-to

50

Publisher name

Schloss Dagstuhl, Leibniz-Zentrum für Informatik

Place of publication

Dagstuhl

Event location

Berkeley

Event date

Jan 30, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

001300389400050