Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic

Thumbnail Image
Download
Name

3564246.3585187.pdf

Size

341.52 KB

Format

Adobe PDF

Checksum (MD5)

c67e4d99ed71abd79e76eac054174f2b

Download all files submitted through automated deposit
3564246.3585187.zip (277 KB)
Author(s)
Ilango, Rahul
•
Li, Jiatu
•
Williams, R. Ryan
Date Issued
June 2, 2023
Publisher
ACM|Proceedings of the 55th Annual ACM Symposium on Theory of Computing
Citation
Ilango, Rahul, Li, Jiatu and Williams, R. Ryan. 2023. "Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/151005
DOI of Published Version
https://doi.org/10.1145/3564246.3585187
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.