Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

1,329 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Theory of Cryptography (2014, background): “Indeed, in a recent breakthrough result, Garg, Gentry, Halevi, Raykova, Sahai and Waters [15] propose a candidate general obfuscation mechanism and conjecture that it is IO for all circuits.”
IRON: Functional Encryption using Intel SGX (2017, background): “Moreover, there is evidence that constructing general-purpose FE is as hard as constructing program obfuscation [4, 9, 23].”
GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, background): “It is also intriguing to understand better the security connection between this construction and the jigsaw puzzle variant used in the construction of a candidate indistinguishability obfuscation mechanism [11].”
BlindBox: Deep Packet Inspection over Encrypted Traffic (2015, background): “At a first glance, it may appear that these two properties are fundamentally at odds with each other: how can a network appliance make decisions based on connection contents when it cannot see these contents?”
Practical Dynamic Searchable Encryption with Small Leakage (2014, background): “Related to searchable encryption is also functional encryption [4], [11], [28], where one encrypts the documents in a way that one can issue tokens that would allow testing whether a specific keyword is contained in the document, without decrypting the document.”