Indistinguishability Obfuscation: From Approximate to Exact by Bitansky, Nir, Vaikuntanathan, Vinod

“…We show general transformations from subexponentially-secure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2+ϵ fraction of inputs on a certain samplable distribution, into exact indistinguishability obfuscation where the obfuscated circuit and the original circuit agree on all inputs. …”
Get full text
Get full text
Get full text

Indistinguishability Obfuscation from Functional Encryption by Bitansky, Nir, Vaikuntanathan, Vinod

“…Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. …”
Get full text
Get full text
Get full text

Indistinguishability Obfuscation from Functional Encryption by Bitansky, Nir, Vaikuntanathan, Vinod

“…© 2018 Association for Computing Machinery. Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. …”
Get full text

Low complexity pseudorandom generators and indistinguishability obfuscation by Lombardi, Alex (Alex John)

Get full text

Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic by Ilango, Rahul, Li, Jiatu, Williams, R. Ryan

Get full text

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings by Bitansky, Nir, Canetti, Ran, Garg, Sanjam, Holmgren, Justin, Jain, Abhishek, Lin, Huijia, Pass, Rafael, Telang, Sidharth, Vaikuntanathan, Vinod

“…We show how to construct indistinguishability obfuscation (\bfi/bfO) for RAM programs with bounded space, assuming/bfi/bfO for circuits and one-way functions, both with subexponential security. …”
Get full text

Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation by Lombardi, Alex, Vaikuntanathan, Vinod

“…Lin and Tessaro (ePrint 2017) recently proposed indistinguishability obfuscation (IO) and functional encryption (FE) candidates and proved their security based on two assumptions: a standard assumption on bilinear maps and a non-standard assumption on “Goldreich-like” pseudorandom generators. …”
Get full text

Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation by Canetti, Ran, Goldwasser, Shafi, Poburinnaya, Oxana

“…It requires a global (nonprogrammable) reference string and is based on one way functions and general-purpose indistinguishability obfuscation with sub-exponential security, as well as augmented non-committing encryption. …”
Get full text

On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation by Lombardi, Alex, Vaikuntanathan, Vinod

Subjects: “…Indistinguishability Obfuscation…”
Get full text

Block Cipher Based Public Key Encryption via Indistinguishability Obfuscation by Aleksandra Horubała, Daniel Waszkiewicz, Michał Andrzejczak, Piotr Sapiecha

Subjects: “…indistinguishability obfuscation…”
Get full text

Towards Lightweight Provable Data Possession for Cloud Storage Using Indistinguishability Obfuscation by Smita Chaudhari, Gandharba Swain

Subjects: Get full text

Cryptanalysis on the HHSS Obfuscation Arising From Absence of Safeguards by Jung Hee Cheon, Minki Hhan, Jiseung Kim, Changmin Lee

Subjects: Get full text

CCA1 secure FHE from PIO, revisited by Biao Wang, Xueqing Wang, Rui Xue

Subjects: “…Probabilistic indistinguishability obfuscation…”
Get full text

Self-Bilinear Map from One Way Encoding System and <i>i𝒪</i> by Huang Zhang, Ting Huang, Fangguo Zhang, Baodian Wei, Yusong Du

Subjects: Get full text

Enabling Search Over Encrypted Cloud Data With Concealed Search Pattern by Jing Yao, Yifeng Zheng, Cong Wang, Xiaolin Gui

Subjects: Get full text

Obfuscation of Probabilistic Circuits and Applications by Ananth, Prabhanjan, Brakerski, Zvika, Segev, Gil, Vaikuntananthan, Vinod

“…We call the resulting notion probabilistic indistinguishability obfuscation (pIO). We define several variants of pIO, and study relations among them. …”
Get full text

Structure vs. hardness through the obfuscation lens by Degwekar, Akshay (Akshay Dhananjai)

Get full text

A Note on Perfect Correctness by Derandomization by Bitansky, Nir, Vaikuntanathan, Vinod

“…We show a general compiler that transforms a large class of erroneous cryptographic schemes (such as public-key encryption, indistinguishability obfuscation, and secure multiparty computation schemes) into perfectly correct ones. …”
Get full text

A Note on Perfect Correctness by Derandomization by Bitansky, Nir, Vaikuntanathan, Vinod

“…We show a general compiler that transforms a large class of erroneous cryptographic schemes (such as public-key encryption, indistinguishability obfuscation, and secure multiparty computation schemes) into perfectly correct ones. …”
Get full text

Defense Against Protocol Level Attack in Tor Network using Deficit Round Robin Queuing Process by K. Sangeetha, K. Ravikumar

“…In Mid-DRRQ mechanism, the protocol-level attacks are prevented by using indistinguishability obfuscation model which generates the fake traffic within the middle relay. …”
Get full text