Explore a 22-minute conference talk from Crypto 2016 that delves into the concept of bounded indistinguishability and its implications for the complexity of recovering secrets. Learn from experts Andrej Bogdanov, Yuval Ishai, Emanuele Viola, and Christopher Williamson as they present their research findings on this intriguing topic in cryptography. Gain insights into the theoretical foundations and practical applications of bounded indistinguishability in secure communication and information protection.
Bounded Indistinguishability and the Complexity of Recovering Secrets
Overview
Syllabus
Bounded Indistinguishability and the Complexity of Recovering Secrets
Taught by
TheIACR
Related Courses
-
On the Complexity of Compressing Obfuscation
-
Semantic Security and Indistinguishability in the Quantum World
-
Tales of Obfuscation in Bounded Arithmetic, Metacomplexity, and Differential Privacy
-
Amortized Complexity of Information Theoretically Secure MPC Revisited
-
Depth Robust Graphs and Their Cumulative Memory Complexity
-
The Exact Round Complexity of Secure Computation
