Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation
Name
2017-301.pdf
Description
Accepted version
Size
582.8 KB
Format
Unknown
Checksum (MD5)
c8bdc6b68a9fb7531bd7fbb68af14152
Author(s)
Lombardi, Alex
Vaikuntanathan, Vinod
Date Issued
2017
Publisher
Springer International Publishing
Citation
Lombardi, Alex and Vaikuntanathan, Vinod. 2017. "Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation."
Version
Author's final manuscript
Abstract
© 2017, International Association for Cryptologic Research. Lin and Tessaro (ePrint 2017) recently proposed indistinguishability obfuscation (IO) and functional encryption (FE) candidates and proved their security based on two assumptions: a standard assumption on bilinear maps and a non-standard assumption on “Goldreich-like” pseudorandom generators. In a nutshell, their second assumption requires the existence of pseudorandom generators G:[q] n → {0,1} m for some poly(n) -size alphabet q, each of whose output bits depend on at most two in put alphabet symbols, and which achieve sufficiently large stretch. We show polynomial-time attacks against such generators, invalidating the security of the IO and FE candidates. Our attack uses tools from the literature on two-source extractors (Chor and Goldreich, SICOMP 1988) and efficient refutation of random 2-XOR instances (Charikar and Wirth, FOCS 2004).
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-70500-2_5
