Explore a thought-provoking conference talk presented at TCC 2019 that delves into the intriguing relationship between permuted puzzles and cryptographic hardness. Gain insights into cutting-edge research in cryptography as the speaker examines the complexities of puzzle permutations and their implications for cryptographic security. Discover how these concepts contribute to the advancement of cryptographic theory and practice in this engaging 26-minute presentation.
Overview
Syllabus
Permuted Puzzles and Cryptographic Hardness (TCC 2019)
Taught by
TheIACR
Related Courses
-
Understanding Cryptographic Hardness in a Quantum World
-
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
-
Cryptographic Hardness of Correlated Sampling
-
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
-
Cryptographic Hardness Amplification - Invited Talk
-
On the Impossibility of Tight Cryptographic Reductions
