Indistinguishability Obfuscation: From Approximate to Exact

作者: Nir Bitansky , Vinod Vaikuntanathan

DOI: 10.1007/978-3-662-49096-9_4

关键词: Ideal (set theory)Core (graph theory)Theoretical computer scienceObfuscation (software)Functional encryptionMathematicsFraction (mathematics)Ciphertext indistinguishabilitySecure multi-party computationAlgorithmTransformation (function)

摘要: We show general transformations from subexponentially-secure approximate indistinguishability obfuscation IO where the obfuscated circuit agrees with original on a $$1/2+\epsilon $$ fraction of inputs certain samplable distribution, into exact and agree all inputs. As step towards our results, which is independent interest, we also obtain an approximate-to-exact transformation for functional encryption. At core techniques method "fooling" obfuscator giving us correct answer, while preserving indistinguishability-based security. This achieved based various types secure computation protocols that can be obtained different standard assumptions. Put together recent results Canetti, Kalai Paneth TCC 2015, Pass Shelat 2016, Mahmoody, Mohammed Nemathaji how to convert schemes in ideal models plain model.

参考文章(64)
Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi, Practical Multilinear Maps over the Integers international cryptology conference. ,vol. 2013, pp. 476- 493 ,(2013) , 10.1007/978-3-642-40041-4_26
Craig Gentry, Allison Lewko, Brent Waters, Witness Encryption from Instance Independent Assumptions Advances in Cryptology – CRYPTO 2014. ,vol. 2014, pp. 426- 443 ,(2014) , 10.1007/978-3-662-44371-2_24
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
Craig Gentry, Sergey Gorbunov, Shai Halevi, Graph-Induced Multilinear Maps from Lattices Theory of Cryptography. pp. 498- 527 ,(2015) , 10.1007/978-3-662-46497-7_20
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee, Functional Encryption with Bounded Collusions via Multi-party Computation international cryptology conference. ,vol. 2012, pp. 162- 179 ,(2012) , 10.1007/978-3-642-32009-5_11
Avi Wigderson, Shafi Goldwasser, Michael Ben-Or, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) symposium on the theory of computing. pp. 1- 10 ,(1988)
Rafael Pass, Karn Seth, Sidharth Telang, Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings Advances in Cryptology – CRYPTO 2014. pp. 500- 517 ,(2014) , 10.1007/978-3-662-44371-2_28
Prabhanjan Ananth, Abhishek Jain, Indistinguishability Obfuscation from Compact Functional Encryption international cryptology conference. ,vol. 2015, pp. 308- 326 ,(2015) , 10.1007/978-3-662-47989-6_15
Jean-Sébastien Coron, Craig Gentry, Shai Halevi, Tancrède Lepoint, Hemanta K. Maji, Eric Miles, Mariana Raykova, Amit Sahai, Mehdi Tibouchi, Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations international cryptology conference. ,vol. 2015, pp. 247- 266 ,(2015) , 10.1007/978-3-662-47989-6_12