YoVDO

Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Turing Machines Courses Theoretical Computer Science Courses Amortization 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 presented at Crypto 2017 that delves into the concept of Indistinguishability Obfuscation for Turing Machines, focusing on constant overhead and amortization. Gain insights from the research paper authored by Prabhanjan Ananth, Abhishek Jain, and Amit Sahai. Learn about advanced cryptographic techniques and their applications in theoretical computer science during this 26-minute presentation. Discover how indistinguishability obfuscation can be applied to Turing machines and understand the implications of constant overhead and amortization in this context.

Syllabus

Indistinguishability Obfuscation for Turing Machines Constant Overhead and Amortization


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