On the Impossibility of Tight Cryptographic Reductions
Offered By: TheIACR via YouTube
Course Description
Overview
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
Automata TheoryStanford 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