Towards a Separation of Semantic and CCA Security for Public Key Encryption

Tal Malkin
Columbia University
Secure systems research

secure public-key encryption primitives imply the existence of chosen ciphertext attack (CCA) secure primitives. We show a black-box separation, using the methodology introduced by
Impagliazzo and Rudich, for a large non-trivial class of constructions. In particular, we show that if the proposed CCA construction's decryption algorithm does not query the semantically secure primitive's encryption algorithm, then the proposed construction
cannot be CCA secure.
Joint work with Yael Gertner and Steve Myers.

Audio (MP3 File, Podcast Ready)

Back to Workshop II: Locally decodable codes, private information retrieval, privacy-preserving data-mining, and public key encryption with special properties