Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization
Offered By: TheIACR via YouTube
Course Description
Overview
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
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera