YoVDO

Efficient KDM CCA Secure Public Key Encryption for Polynomial Functions

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Polynomial Functions Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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

Building Geospatial Apps on Postgres, PostGIS, & Citus at Large Scale
Microsoft via YouTube Unlocking the Power of ML for Your JavaScript Applications with TensorFlow.js
TensorFlow via YouTube Managing the Reactive World with RxJava - Jake Wharton
ChariotSolutions via YouTube What's New in Grails 2.0
ChariotSolutions via YouTube Performance Analysis of Apache Spark and Presto in Cloud Environments
Databricks via YouTube