Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization

Indistinguishability Obfuscation for Turing Machines - Constant Overhead and Amortization

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.