Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

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.