YoVDO

Bounded Indistinguishability and the Complexity of Recovering Secrets

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Theoretical Computer Science Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Bounded Indistinguishability and the Complexity of Recovering Secrets


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera