On the impossibility of strong encryption over N0

Raphael C.W. Phan; Serge Vaudenay

doi:10.1007/978-3-642-01877-0_17

On the impossibility of strong encryption over N₀

Raphael C.W. Phan, Serge Vaudenay

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

4 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings
Pages	202-218
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-01877-0_17
Publication status	Published - 2009
Externally published	Yes
Event	International Workshop on Coding and Cryptology 2009 - Zhangjiajie, China Duration: 1 Jun 2009 → 5 Jun 2009 Conference number: 2nd https://link.springer.com/book/10.1007/978-3-642-01877-0 (Proceedings)

Publication series

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

Conference

Conference	International Workshop on Coding and Cryptology 2009
Abbreviated title	IWCC 2009
Country/Territory	China
City	Zhangjiajie
Period	1/06/09 → 5/06/09
Internet address	https://link.springer.com/book/10.1007/978-3-642-01877-0 (Proceedings)

Access to Document

10.1007/978-3-642-01877-0_17

Cite this

Phan, R. C. W., & Vaudenay, S. (2009). On the impossibility of strong encryption over N₀. In Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings (pp. 202-218). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5557 LNCS). https://doi.org/10.1007/978-3-642-01877-0_17

@inproceedings{5800ea49487b4e358d669cef7ad96a5b,

title = "On the impossibility of strong encryption over N0",

abstract = "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.",

author = "Phan, {Raphael C.W.} and Serge Vaudenay",

year = "2009",

doi = "10.1007/978-3-642-01877-0_17",

language = "English",

isbn = "3642018130",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "202--218",

booktitle = "Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings",

url = "https://link.springer.com/book/10.1007/978-3-642-01877-0",

}

Phan, RCW & Vaudenay, S 2009, On the impossibility of strong encryption over N₀. in Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5557 LNCS, pp. 202-218, International Workshop on Coding and Cryptology 2009, Zhangjiajie, China, 1/06/09. https://doi.org/10.1007/978-3-642-01877-0_17

On the impossibility of strong encryption over N₀. / Phan, Raphael C.W.; Vaudenay, Serge.
Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings. 2009. p. 202-218 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5557 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - On the impossibility of strong encryption over N0

AU - Phan, Raphael C.W.

AU - Vaudenay, Serge

N1 - Conference code: 2nd

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=69849112211&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-01877-0_17

DO - 10.1007/978-3-642-01877-0_17

M3 - Conference Paper

AN - SCOPUS:69849112211

SN - 3642018130

SN - 9783642018138

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 202

EP - 218

BT - Coding and Cryptology - Second International Workshop, IWCC 2009, Proceedings

T2 - International Workshop on Coding and Cryptology 2009

Y2 - 1 June 2009 through 5 June 2009

ER -