YoVDO

Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Mathematics 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 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.

Syllabus

Non Uniform Bounds in the Random Permutation, Ideal Cipher, and Generic Group Models


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