A Note on Perfect Correctness by Derandomization

Explore a conference talk on perfect correctness in cryptography through derandomization techniques. Delve into the importance of eliminating negligible errors in cryptographic schemes, focusing on the work presented by Nir Bitansky and Vinod Vaikuntanathan at Eurocrypt 2017. Examine the role of randomness in cryptography, learn about the concept of avoiding errors, and understand the basic ideas behind achieving perfect correctness. Investigate NW-PRGs and their significance in this context, as well as methods for correcting cryptographic schemes, particularly in public-key encryption. Discover the process of decoupling correctness and security, and gain insights into enumeration techniques and the concept of cryptographic strings. Conclude with a comprehensive recap of the presented ideas and their implications for the field of cryptography.

Intro
Randomness in Cryptography
Why Care About Negligible Errors?
Avoiding Errors
This work in a Nutshell
More Precisely
The Basic Idea
NW-PRGS: The Right Picture
Correcting Cryptographic Schemes (PKE)
Decoupling Correctness and Security
Enumeration
Back to Decoupling Desiderata
The Cryptographic String
Remarks
Recap