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.
Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions
Overview
Syllabus
Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions
Taught by
TheIACR
Related Courses
-
Tightly CCA-Secure Encryption Without Pairings
-
Detecting Dangerous Queries - A New Approach for Chosen C
-
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors
-
Public Key Encryption - Crypto 2024
-
Limits on the Power of Garbling Techniques for Public Key Encryption
-
Master-Key KDM-Secure IBE from Pairings
