On the Impossibility of Strong Encryption Over

Raphael C.-w. Phan, Serge Vaudenay

Abstract

We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphertext attacks in streaming mode with bounded resources: memory, time delay or output length. Curiously, both impossibility results can be achieved with either finite or continuous domains. The latter result explains why known CCA-secure cryptosystem constructions require at least two passes to decrypt a message with bounded resources.
BibTeX
@inproceedings{phan2009impossibility,
  author = {Raphael C.-W. Phan and Serge Vaudenay},
  title = {{On the Impossibility of Strong Encryption Over}},
  booktitle = {Iwcc},
  year = {2009},
  doi = {10.1007/978-3-642-01877-0\_17},
}

Loading related content...

Figure