Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

作者: Gilad Asharov , Gil Segev

DOI: 10.1109/FOCS.2015.21

关键词:

摘要: Recent breakthroughs in cryptography have positioned indistinguishability obfuscation as a "central hub" for almost all known cryptographic tasks, and an extremely powerful building block new tasks resolving long-standing foundational open problems. However, constructions based on always rely non-black-box techniques, thus the extent to which it can be used has been completely unexplored so far. We present framework proving meaningful negative results power of obfuscation. By considering oracle-aided circuits, we capture common techniques that far These include, particular, such punctured programming approach Sahai Waters (STOC '14) its variants, well sub-exponential security assumptions. Within our prove first tightly related notion functional encryption. Our are follows: -- There is no fully black-box construction collision-resistant function family from obfuscator circuits. key-agreement protocol with perfect completeness private-key encryption scheme Specifically, any potential must suffer exponential loss, cannot circumvented using captures may wide variety primitives manner (e.g., Obfuscating or generating key uses evaluation circuit puncturable pseudorandom function), only assume underlying themselves manner.

参考文章(64)
Shafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, Hong-Sheng Zhou, Multi-input Functional Encryption theory and application of cryptographic techniques. pp. 578- 602 ,(2014) , 10.1007/978-3-642-55220-5_32
Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan, Obfuscation of Probabilistic Circuits and Applications Theory of Cryptography. pp. 468- 497 ,(2015) , 10.1007/978-3-662-46497-7_19
Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin, Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? Theory of Cryptography. pp. 217- 239 ,(2014) , 10.1007/978-3-642-54242-8_10
Dan Boneh, Mark Zhandry, Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation Advances in Cryptology – CRYPTO 2014. ,vol. 2013, pp. 480- 499 ,(2014) , 10.1007/978-3-662-44371-2_27
Ran Canetti, Yael Tauman Kalai, Omer Paneth, On Obfuscation with Random Oracles Theory of Cryptography. pp. 456- 467 ,(2015) , 10.1007/978-3-662-46497-7_18
Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs, On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input Advances in Cryptology – CRYPTO 2014. ,vol. 2013, pp. 518- 535 ,(2014) , 10.1007/978-3-662-44371-2_29
Sanjam Garg, Antigoni Polychroniadou, Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation Theory of Cryptography. pp. 614- 637 ,(2015) , 10.1007/978-3-662-46497-7_24
Ran Canetti, Shafi Goldwasser, Oxana Poburinnaya, Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation Theory of Cryptography. pp. 557- 585 ,(2015) , 10.1007/978-3-662-46497-7_22
Dana Dachman-Soled, Jonathan Katz, Vanishree Rao, Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds Theory of Cryptography. pp. 586- 613 ,(2015) , 10.1007/978-3-662-46497-7_23