Unconditional UC Secure Computation with Stronger Malicious PUFs
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a conference talk presenting a paper on unconditional UC secure computation using stronger malicious Physically Unclonable Functions (PUFs). Delve into the research conducted by Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, and Ivan Visconti, which was presented at Eurocrypt 2017. Learn about the advancements in cryptographic protocols and the potential implications for secure computation in the presence of malicious adversaries. Gain insights into how stronger malicious PUFs can enhance security measures in various cryptographic applications.
Syllabus
Unconditional UC Secure Computation with Stronger Malicious PUFs
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