On the Impossibility of Strong Encryption over \aleph_{0}

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.


Published in:
proceedings of IWCC 2009, 202-218
Presented at:
International Workshop on Coding and Cryptology, Zhangjiajie, Hunan, China, June 1-5, 2009
Year:
2009
Publisher:
Springer Berlin / Heidelberg
Laboratories:




 Record created 2009-06-08, last modified 2018-03-17

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)