Indistinguishability obfuscation from circular security

Romain Gay, Rafael Pass

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show the existence of indistinguishability obfuscators (iO) for general circuits assuming subexponential security of: (a) the Learning with Errors (LWE) assumption (with subexponential modulus-to-noise ratio); (b) a circular security conjecture regarding the Gentry-Sahai-Waters' (GSW) encryption scheme and a Packed version of Regev's encryption scheme. The circular security conjecture states that a notion of leakage-resilient security, that we prove is satisfied by GSW assuming LWE, is retained in the presence of an encrypted key-cycle involving GSW and Packed Regev.

Original languageEnglish
Title of host publicationSTOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
EditorsSamir Khuller, Virginia Vassilevska Williams
PublisherAssociation for Computing Machinery
Pages736-749
Number of pages14
ISBN (Electronic)9781450380539
DOIs
StatePublished - 15 Jun 2021
Externally publishedYes
Event53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 - Virtual, Online, Italy
Duration: 21 Jun 202125 Jun 2021

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021
Country/TerritoryItaly
CityVirtual, Online
Period21/06/2125/06/21

Funding

FundersFunder number
National Science FoundationSATC-1704788, RI-1703846
Air Force Office of Scientific ResearchFA9550-18-1-0267
Defense Advanced Research Projects AgencyHR00110C0086
Office of the Director of National Intelligence
Intelligence Advanced Research Projects Activity2019-19-020700006

    Keywords

    • LWE
    • obfuscation

    Fingerprint

    Dive into the research topics of 'Indistinguishability obfuscation from circular security'. Together they form a unique fingerprint.

    Cite this