Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography
Name
3618260.3649602.pdf
Size
244.18 KB
Format
Adobe PDF
Checksum (MD5)
78abc79636b813d2330e76bbbf96f19c
Author(s)
Chen, Yilei
Li, Jiatu
Date Issued
June 10, 2024
Journal
STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing
Publisher
ACM
Citation
Chen, Yilei and Li, Jiatu. 2024. "Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography." STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing.
Version
Final published version
Abstract
A recent line of research has introduced a systematic approach to exploring the complexity of explicit construction problems through the use of meta-problems, namely, the range avoidance problem (abbrev. Avoid) and the remote point problem (abbrev. ). The upper and lower bounds for these meta problems provide a unified perspective on the complexity of specific explicit construction problems that were previously studied independently. An interesting question largely unaddressed by previous works is whether we can show hardness of Avoid and RPP for simple circuits, such as low-depth circuits. In this paper, we demonstrate, under plausible cryptographic assumptions, that both the range avoidance problem and the remote point problem cannot be efficiently solved by nondeterministic search algorithms, even when the input circuits are as simple as constant-depth circuits. This extends a hardness result established by Ilango, Li, and Williams (STOC’23) against deterministic algorithms employing witness encryption for NP, where the inputs to Avoid are general Boolean circuits. Our primary technical contribution is a novel construction of witness encryption inspired by public-key encryption for certain promise language in NP that is unlikely to be NP-complete. We introduce a generic approach to transform a public-key encryption scheme with particular properties into a witness encryption scheme for a promise language related to the initial public-key encryption scheme. Based on this translation and variants of standard lattice-based or coding-based PKE schemes, we obtain, under plausible assumption, a provably secure witness encryption scheme for some promise language in NP-coNP/poly. Additionally, we show that our constructions of witness encryption are plausibly secure against nondeterministic adversaries under a generalized notion of security in the spirit of Rudich’s super-bits (RANDOM’97), which is crucial for demonstrating the hardness of Avoid and RPP against nondeterministic algorithms.
Description
STOC ’24, June 24–28, 2024, Vancouver, BC, Canada
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3618260.3649602
