Optimal Bounded-Collusion Secure Functional Encryption and FE Combiners for Secure MPC
Offered By: TheIACR via YouTube
Course Description
Overview
Explore two cutting-edge cryptography talks presented by Prabhanjan Ananth at TCC 2019. Delve into "Optimal Bounded-Collusion Secure Functional Encryption" and "From FE Combiners to Secure MPC and Back" to gain insights into advanced concepts in functional encryption and secure multi-party computation. Learn about the latest developments in bounded-collusion security and the intriguing connections between functional encryption combiners and secure MPC protocols. This 32-minute presentation offers a deep dive into theoretical cryptography, providing valuable knowledge for researchers and practitioners in the field.
Syllabus
Optimal Bounded Collusion Secure Functional Encryption + From FE Combiners to Secure... (TCC 2019)
Taught by
TheIACR
Related Courses
EncryptionTheIACR via YouTube Welcome - Functional Encryption and Identity Based Encryption
TheIACR via YouTube A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials
TheIACR via YouTube Combiners for Functional Encryption, Unconditionally
TheIACR via YouTube A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs
Association for Computing Machinery (ACM) via YouTube