@inproceedings{b78fb7d5f75d4adab9b4bb87eb083605,
title = "On the cryptographic hardness of local search",
abstract = "We show new hardness results for the class of Polynomial Local Search problems (PLS): Hardness of PLS based on a falsifiable assumption on bilinear groups introduced by Kalai, Paneth, and Yang (STOC 2019), and the Exponential Time Hypothesis for randomized algorithms. Previous standard model constructions relied on non-falsifiable and non-standard assumptions. Hardness of PLS relative to random oracles. The construction is essentially different than previous constructions, and in particular is unconditionally secure. The construction also demonstrates the hardness of parallelizing local search. The core observation behind the results is that the unique proofs property of incrementally-verifiable computations previously used to demonstrate hardness in PLS can be traded with a simple incremental completeness property.",
keywords = "Cryptography, Incremental computation, Lower bounds, PLS",
author = "Nir Bitansky and Idan Gerichter",
note = "Publisher Copyright: {\textcopyright} Nir Bitansky and Idan Gerichter.; 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 ; Conference date: 12-01-2020 Through 14-01-2020",
year = "2020",
month = jan,
doi = "10.4230/LIPIcs.ITCS.2020.6",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Thomas Vidick",
booktitle = "11th Innovations in Theoretical Computer Science Conference, ITCS 2020",
}