### Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits

Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, and Brent Waters

##### Abstract

In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C_0 and C_1 of similar size, the obfuscations of C_0 and C_1 should be computationally indistinguishable. In functional encryption, ciphertexts encrypt inputs x and keys are issued for circuits C. Using the key SK_C to decrypt a ciphertext CT_x = Enc(x), yields the value C(x) but does not reveal anything else about x. Furthermore, no collusion of secret key holders should be able to learn anything more than the union of what they can each learn individually. We give constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits. We accomplish this goal in three steps: - We describe a candidate construction for indistinguishability obfuscation for NC1 circuits. The security of this construction is based on a new algebraic hardness assumption. The candidate and assumption use a simplified variant of multilinear maps, which we call Multilinear Jigsaw Puzzles. - We show how to use indistinguishability obfuscation for NC1 together with Fully Homomorphic Encryption (with decryption in NC1) to achieve indistinguishability obfuscation for all circuits. - Finally, we show how to use indistinguishability obfuscation for circuits, public-key encryption, and non-interactive zero knowledge to achieve functional encryption for all circuits. The functional encryption scheme we construct also enjoys succinct ciphertexts, which enables several other applications.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
ObfuscationFunctional EncryptionMultilinear Maps
Contact author(s)
amitsahai @ gmail com
History
Short URL
https://ia.cr/2013/451

CC BY

BibTeX

@misc{cryptoeprint:2013/451,
author = {Sanjam Garg and Craig Gentry and Shai Halevi and Mariana Raykova and Amit Sahai and Brent Waters},
title = {Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits},
howpublished = {Cryptology ePrint Archive, Paper 2013/451},
year = {2013},
note = {\url{https://eprint.iacr.org/2013/451}},
url = {https://eprint.iacr.org/2013/451}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.