Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a concise talk from Asiacrypt 2016 that delves into efficient key-dependent message (KDM) chosen-ciphertext attack (CCA) secure public key encryption for polynomial functions. Learn about the research findings presented by Shuai Han, Shengli Liu, and Lin Lyu as they discuss advancements in cryptographic techniques and their applications to secure communication systems.
Syllabus
Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions
Taught by
TheIACR
Related Courses
College Algebra and Problem SolvingArizona State University via edX Pre-Calculus
Universitat Autònoma de Barcelona (Autonomous University of Barcelona) via Coursera 5.- Cálculo Diferencial e Integral unidos por el Teorema Fundamental del Cálculo
Tecnológico de Monterrey via Coursera Cálculo Diferencial e Integral unidos por el Teorema Fundamental del Cálculo
Tecnológico de Monterrey via Coursera Precalculus
Arizona State University via edX