Optimal Security Proofs for Full Domain Hash, Revisited
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a critical analysis of security proofs for Full Domain Hash (FDH) signatures in this 20-minute talk from Eurocrypt 2012. Delve into the classical security results of RSA FDH, uncover a flaw in Coron's proof, and learn about the proposed fix. Examine the concept of RSA certification and the lossiness of RSA. Discover the main results presented by authors Saqib A. Kakvi and Eike Kiltz, and investigate extensions including generalizations and PSS with message recovery. Gain valuable insights into optimal security proofs for cryptographic signatures in this comprehensive presentation.
Syllabus
Intro
RSA Full Domain Hash Signatures
Classical security results of RSA FDH
Flaw in Coron's Proof
Fixing Coron's Proof
Is RSA certified?
Lossiness of RSA
Main Result
Extensions: Generalizations
Extensions: PSS with message recovery
Conclusion
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity 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