Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Detecting Dangerous Queries - A New Approach for Chosen C

TheIACR via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a conference talk from Eurocrypt 2012 that introduces a novel approach for detecting dangerous queries in cryptographic systems. Delve into the concepts of public key encryption, indistinguishability under chosen plaintext and ciphertext attacks, and the goal of achieving CCA security from CPA. Examine the proposed DCCA security model, its properties, and examples. Learn about the setup process, nested indistinguishability games, and gain insights into the proof overview. Understand the challenges and implications of this new approach in the field of cryptography.

Syllabus

Detecting Dangerous Queries
Public Key Encryption DH76,RSA78,GM84
IND-CPA (GM84) Indistinguishability under Chosen Plaintext Attack
IND-CCA (NY90, DDN91,RS91) Indistinguishability under Chosen Ciphertext Attack
The Grand Goal: CCA from CPA
Some Prior Methods (Standard Model)
1-bit CCA to n-bit CCA MS09
Our Result
DCCA Security: Intuition
Detectable Encryption System
Property 1: Hard to Predict (Strong)
Property 2: Indistinguishability
Examples
The Ingredients
Setup
A Few Comments
What is the trouble?
Nested Indist. Game
Proof Overview
Summary
Our Picture (not necessarily to scale)
Thank you

Taught by

TheIACR

Reviews

Start your review of Detecting Dangerous Queries - A New Approach for Chosen C

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.