On the Impossibility of Strong Encryption Over

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.

• Type: Conference
• Year: 2009
• Where: CODCRY
• Authors: Raphael C.-W. Phan, Serge Vaudenay
• Keywords: CODCRY 2009, Cryptology, Infinite Enumerable Domain, One-time Encryption, Strong Encryption