Explore a 21-minute conference talk presented at Crypto 2018 that delves into the research paper on non-uniform bounds in the random permutation, ideal cipher, and generic group models. Gain insights into the work of Sandro Coretti, Yevgeniy Dodis, and Siyao Guo as they discuss their findings and implications for cryptographic security. Learn about the challenges and advancements in these fundamental cryptographic models, and understand how non-uniform bounds impact the field of cryptography.
Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models
Overview
Syllabus
Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models
Taught by
TheIACR
Related Courses
-
Fixing Cracks in the Concrete Random Oracles with Auxiliary Input, Revisited
-
An Efficient Pairing Based Shuffle Argument
-
The Exact PRF Security of Truncation - Tight Bounds for Keyed Sponges and Truncated CBC
-
Generic Transformations of Predicate Encodings - Constructions and Applications
-
Random Oracle Models in Cryptography - Session 1
-
Polynomial Data Structure Lower Bounds in the Group Model
