3SUM with Preprocessing - Algorithms, Lower Bounds, and Cryptographic Applications
Speaker: ThibautTitle: 3SUM with Preprocessing - Algorithms, Lower Bounds, and Cryptographic Applications
Date: 05 Aug 2019 5:30pm-7:00pm
Location: Maxwell-Dworkin 323
Food: Indian
Abstract: Motivated by the problem of building cryptographic primitives from compromised ones, we study the question of building one-way functions from a random oracle whose truth table can be preprocessed by an unbounded adversary into an exponentially large lookup table. We present a construction whose security reduces to the average-case hardness of 3SUM-Indexing—a data structure variant of the 3SUM problem—and prove new upper and lower bounds on its hardness. Based on joint work with Alexander Golovnev, Siyao Guo, Sunoo Park and Vinod Vaikuntanathan (https://arxiv.org/pdf/1907.08355.pdf)