YoVDO

On the Complexity of Compressing Obfuscation

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Theoretical Computer Science Courses Indistinguishability Obfuscation Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk on the complexity of compressing obfuscation, presented at Crypto 2018. Delve into the paper by Gilad Asharov, Naomi Ephraim, Ilan Komargodski, and Rafael Pass, which examines indistinguishability obfuscation, compression hierarchy, and their implications. Learn about the existence of io, the impact of results, the black-box model, and statistically secure compressing obfuscation. Gain insights into this 22-minute presentation that covers key concepts in cryptography and obfuscation techniques.

Syllabus

Intro
Indistinguishability Obfuscation (10)
Existence of io
Compression Hierarchy
Impact of Results
Black-Box Model
Statisticaly Secure Compressing Obfuscation
Conclusion


Taught by

TheIACR

Related Courses

Cryptography for Quantum Computers
Simons Institute via YouTube Indistinguishability Obfuscation from Well Founded Assumptions - Part 1
IEEE via YouTube Indistinguishability Obfuscation from Well Founded Assumptions - Part 3
IEEE via YouTube Mutual Empowerment Between Circuit Obfuscation and Circuit Minimization
Simons Institute via YouTube The Mathematics of Hiding Secrets in Software
International Mathematical Union via YouTube