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

Automata Theory
Stanford 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