Explore a detailed analysis of candidate branching program obfuscators in this 22-minute conference talk presented at Eurocrypt 2017. Delve into the research findings of Yilei Chen, Craig Gentry, and Shai Halevi as they discuss cryptanalytic techniques and potential vulnerabilities in obfuscation schemes. Gain insights into the challenges and complexities of secure program obfuscation in cryptography.
Cryptanalyses of Candidate Branching Program Obfuscators
Overview
Syllabus
Cryptanalyses of Candidate Branching Program Obfuscators
Taught by
TheIACR
Related Courses
-
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem
-
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
-
Fully Homomorphic Encryption with Polylog Overhead
-
Candidate iO From Homomorphic Encryption Schemes
-
A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs
-
Annihilation Attacks for Multilinear Maps - Cryptanalysis of Indistinguishability Obfuscation over GG
