Given an arbitrary function $f:[N]\to[M]$, the function inversion problem asks to preprocess $f$ and to be able to, when given some $y\in [M]$, decide whether there exists some $x\in [N]$ such that $f(x)=y$ and if so, to report such an $x$. Recently, Fiat-Naor's solution to this problem has seen significant traction in theoretical computer science, and allowed for several conjectures related to meta-complexity and the 3SUM problem to be broken. In this paper, we consider the natural extension of the function inversion problem that we call preimage reporting. Here, instead of having to report only one $x\in [N]$ such that $f(x)=y$, the whole set $f^{-1}(y)$ must be found. We present a new general method to convert any arbitrary function inversion scheme into an efficient corresponding preimage reporting scheme. In particular, if $Δ$ is the maximal indegree of $f$, we show that we can perform preimage reporting using space $S$ in time $T$ for any $T$ and $S$ satisfying $TS^2=N^2 Δ$, matching a variant of a tradeoff obtained by Fiat and Naor for function inversion. This last result implies an improvement over the corresponding function inversion scheme itself, which constitutes the first function inversion scheme whose query time is inversely proportional to $|f^{-1}(y)|$. We derive new simple solutions for the $k$SUM-indexing with reporting and Jumbled indexing with reporting problems.

翻译：暂无翻译