Year: 2026
Type: preprint
Abstract: Non-local search-to-decision asks whether the difficulty of two non-communicating (non-local) parties both predicting x given a bipartite state (that possibly depends on x) implies the difficulty of non-local parties both predicting the inner product , for a uniformly random r. This problem and its variants have been extensively studied and are motivated by applications to unclonable cryptographic primitives such as unclonable encryption and copy-protection. We study the identical-challenge setting, in which both parties receive the same uniformly random vector r, in contrast to the independently sampled challenges considered in prior works. We demonstrate positive results for the cases when $x$ and r are vectors over F_2 and over large finite fields. As a consequence, we obtain a conceptually different proof of indistinguishability-secure unclonable encryption.
Source: arXiv (Cornell University)
Author: Ananth, Prabhanjan
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7203920184