作者: Nir Bitansky , Vinod Vaikuntanathan
DOI: 10.1007/978-3-662-49096-9_4
关键词: Ideal (set theory) 、 Core (graph theory) 、 Theoretical computer science 、 Obfuscation (software) 、 Functional encryption 、 Mathematics 、 Fraction (mathematics) 、 Ciphertext indistinguishability 、 Secure multi-party computation 、 Algorithm 、 Transformation (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.