Advertisement
Published in:
2009 | OriginalPaper | Chapter
On the Impossibility of Strong Encryption Over
Authors : Raphael C. -W. Phan, Serge Vaudenay
Published in: Coding and Cryptology
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.