Low Error Efficient Computational Extractors in the CRS Model
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a presentation on low error efficient computational extractors in the CRS model from Eurocrypt 2020. Delve into weak sources, randomness extractors, and two-source extractors with negligible error. Examine computational 2-source extractors and non-malleable extractors, including their construction and proof intuition. Learn how to convert non-malleable extractors with high entropy to 2-extractors with low entropy. Conclude with open problems in the field of cryptographic extractors.
Syllabus
Intro
Weak Sources
Randomness Extractors
Two-Source Extractors with Negligible Error
Computational 2-Source Extractors with Negligible Error
Non-malleable Extractors (DW09)
Non-malleable Extractors: Construction
Non-malleable Extractors: Proof Intuition
NM-Ext with high entropy to 2-Ext with low entropy
Conclusion
Open Problems
Taught by
TheIACR
Related Courses
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera