Derandomization: A Quick Tutorial
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a comprehensive tutorial on derandomization, focusing on transforming doubly efficient constant-round interactive protocols into NP-type verifiers with similar time complexity. Delve into the construction of NP-type deterministic argument systems for counting satisfying assignments of large formulas under strong hardness assumptions. Examine the use of targeted pseudorandom generators (tarPRGs) in the interactive protocol setting, drawing parallels to the Fiat-Shamir approach. Learn about the application of complexity-theoretic assumptions that don't necessarily imply one-way functions. Gain insights into recent advancements in derandomization techniques and their implications for cryptography and computational complexity theory.
Syllabus
Derandomization: A Quick Tutorial
Taught by
Simons Institute
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