On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
作者： Mohammad Mahmoody , Ameer Mohammed , Soheil Nematihaji
DOI: 10.1007/978-3-662-49096-9_2
关键词:
摘要: The celebrated work of Barak eti¾?al. Crypto'01 ruled out the possibility virtual black-box VBB obfuscation for general circuits. recent Canetti, Kalai, and Paneth TCC'15 extended this impossibility to random oracle model as well assuming existence trapdoor permutations TDPs. On other hand, works Crypto'14 Brakerski-Rothblum TCC'14 showed that is indeed possible in idealized graded encoding models. Pass Shelat Cryptology ePrint 2015/383 complemented result by ruling models enable evaluation constant-degree polynomials finite fields. In work, we extend above two results In particular prove following both permutations: There no generic group Shoup Eurocrypt'97 any abelian group. By applying our techniques setting their even non-commutative ring.There permutation model. Note opposed which an primitive symmetric primitives, public-key primitive.
springer.com
sci-hub.se 参考文章(19)
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
Benjamin Lynn, Manoj Prabhakaran, Amit Sahai, Positive Results and Techniques for Obfuscation theory and application of cryptographic techniques. pp. 20- 39 ,(2004) , 10.1007/978-3-540-24676-3_2
Jeremy Horwitz, Ben Lynn, Toward Hierarchical Identity-Based Encryption international cryptology conference. pp. 466- 481 ,(2002) , 10.1007/3-540-46035-7_31
Sanjam Garg, Craig Gentry, Shai Halevi, Candidate Multilinear Maps from Ideal Lattices theory and application of cryptographic techniques. pp. 1- 17 ,(2013) , 10.1007/978-3-642-38348-9_1
Omer Reingold, Luca Trevisan, Salil Vadhan, Notions of Reducibility between Cryptographic Primitives theory of cryptography conference. pp. 1- 20 ,(2004) , 10.1007/978-3-540-24638-1_1
Vipul Goyal, Virendra Kumar, Satya Lokam, Mohammad Mahmoody, On black-box reductions between predicate encryption schemes theory of cryptography conference. pp. 440- 457 ,(2012) , 10.1007/978-3-642-28914-9_25
R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 44- 61 ,(1989) , 10.1145/73007.73012
Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters, Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. pp. 40- 49 ,(2013) , 10.1109/FOCS.2013.13
Ran Canetti, Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information international cryptology conference. pp. 455- 469 ,(1997) , 10.1007/BFB0052255
Boaz Barak, Oded Goldreich, Rusell Impagliazzo, Steven Rudich, Amit Sahai, Salil Vadhan, Ke Yang, On the (Im)possibility of Obfuscating Programs international cryptology conference. pp. 1- 18 ,(2001) , 10.1007/3-540-44647-8_1