Paper 2017/943
When does Functional Encryption Imply Obfuscation?
Sanjam Garg, Mohammad Mahmoody, and Ameer Mohammed
Abstract
Realizing indistinguishablility obfuscation (IO) based on well-understood computational assumptions is an important open problem. Recently, realizing functional encryption (FE) has emerged as promising directing towards that goal. This is because: (1) compact single-key FE (where the functional secret-key is of length double the ciphertext length) is known to imply IO [Anath and Jain,
CRYPTO 2015; Bitansky and Vaikuntanathan, FOCS 2015] and (2) several strong variants of single-key FE are known based on various standard computation assumptions.
In this work, we study when FE can be used for obtaining IO.
We show any single-key FE for function families with ``short'' enough outputs (specifically the output is less than ciphertext length by a value at least
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in TCC 2017
- Keywords
- Blackbox separationsFunctional EncryptionIndistinguishability Obfuscation
- Contact author(s)
-
sanjamg @ berkeley edu
mahmoody @ gmail com
am8zv @ virginia edu - History
- 2017-09-27: received
- Short URL
- https://ia.cr/2017/943
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/943, author = {Sanjam Garg and Mohammad Mahmoody and Ameer Mohammed}, title = {When does Functional Encryption Imply Obfuscation?}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/943}, year = {2017}, url = {https://eprint.iacr.org/2017/943} }