Sciweavers

Share
CODCRY
2009
Springer

On the Impossibility of Strong Encryption Over

10 years 4 months ago
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.
Raphael C.-W. Phan, Serge Vaudenay
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CODCRY
Authors Raphael C.-W. Phan, Serge Vaudenay
Comments (0)
books