YoVDO

On the Impossibility of Tight Cryptographic Reductions

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 thought-provoking talk from Eurocrypt 2016 that delves into the challenges and limitations of tight cryptographic reductions. Presented by Christoph Bader, Tibor Jager, Yong Li, and Sven Schäge, this 25-minute discussion examines the fundamental concepts and theoretical barriers in cryptography. Gain insights into the complexities of creating secure cryptographic systems and understand why achieving tight reductions in certain scenarios may be inherently impossible.

Syllabus

On the Impossibility of Tight Cryptographic Reductions


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