On the impossibility of strong encryption over N0

Raphael C.W. Phan, Serge Vaudenay

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

2 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationCoding and Cryptology - Second International Workshop, IWCC 2009, Proceedings
Number of pages17
Publication statusPublished - 2009
Externally publishedYes
EventInternational Workshop on Coding and Cryptology 2009 - Zhangjiajie, China
Duration: 1 Jun 20095 Jun 2009
Conference number: 2nd
https://link.springer.com/book/10.1007/978-3-642-01877-0 (Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5557 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Workshop on Coding and Cryptology 2009
Abbreviated titleIWCC 2009
Internet address

Cite this