On the Impossibility of Strong Encryption over aleph {0}Reportar como inadecuado




On the Impossibility of Strong Encryption over aleph {0} - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Presented at: International Workshop on Coding and Cryptology, Zhangjiajie, Hunan, China, June 1-5, 2009 Published in: proceedings of IWCC 2009, p. 202-218 Series: Lecture Notes in Computer Science 5557 : Springer Berlin / Heidelberg, 2009

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 mes- sage with bounded resources.

Reference LASEC-CONF-2009-005





Autor: Phan, Raphael Chung-Wei; Vaudenay, Serge

Fuente: https://infoscience.epfl.ch/record/138726?ln=en







Documentos relacionados