A domain extender for the ideal cipher

Jean Sébastien Coron; Yevgeniy Dodis; Avradip Mandal; Yannick Seurin

doi:10.1007/978-3-642-11799-2_17

A domain extender for the ideal cipher

Jean Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construction is based on a 3-round Feistel, and is more efficient than first building a n-bit random oracle from a n-bit ideal cipher (as in [9]) and then a 2n-bit ideal cipher from a n-bit random oracle (as in [10], using a 6-round Feistel). We also show that 2 rounds are not enough for indifferentiability by exhibiting a simple attack. We also consider our construction in the standard model: we show that 2 rounds are enough to get a 2n-bit tweakable block-cipher from a n-bit tweakable block-cipher and we show that with 3 rounds we can get beyond the birthday security bound.

Original language	English (US)
Title of host publication	Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings
Pages	273-289
Number of pages	17
DOIs	https://doi.org/10.1007/978-3-642-11799-2_17
State	Published - 2010
Event	7th Theory of Cryptography Conference, TCC 2010 - Zurich, Switzerland Duration: Feb 9 2010 → Feb 11 2010

Publication series

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

Other

Other	7th Theory of Cryptography Conference, TCC 2010
Country/Territory	Switzerland
City	Zurich
Period	2/9/10 → 2/11/10

Keywords

Ideal cipher model
Indifferentiability
Tweakable block-cipher

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-11799-2_17

Cite this

Coron, J. S., Dodis, Y., Mandal, A., & Seurin, Y. (2010). A domain extender for the ideal cipher. In Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings (pp. 273-289). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5978 LNCS). https://doi.org/10.1007/978-3-642-11799-2_17

A domain extender for the ideal cipher. / Coron, Jean Sébastien; Dodis, Yevgeniy; Mandal, Avradip et al.
Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. 2010. p. 273-289 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5978 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Coron, JS, Dodis, Y, Mandal, A & Seurin, Y 2010, A domain extender for the ideal cipher. in Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5978 LNCS, pp. 273-289, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, 2/9/10. https://doi.org/10.1007/978-3-642-11799-2_17

@inproceedings{e88cb2ea8dad443cadd104a658d02532,

title = "A domain extender for the ideal cipher",

abstract = "We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construction is based on a 3-round Feistel, and is more efficient than first building a n-bit random oracle from a n-bit ideal cipher (as in [9]) and then a 2n-bit ideal cipher from a n-bit random oracle (as in [10], using a 6-round Feistel). We also show that 2 rounds are not enough for indifferentiability by exhibiting a simple attack. We also consider our construction in the standard model: we show that 2 rounds are enough to get a 2n-bit tweakable block-cipher from a n-bit tweakable block-cipher and we show that with 3 rounds we can get beyond the birthday security bound.",

keywords = "Ideal cipher model, Indifferentiability, Tweakable block-cipher",

author = "Coron, {Jean S{\'e}bastien} and Yevgeniy Dodis and Avradip Mandal and Yannick Seurin",

year = "2010",

doi = "10.1007/978-3-642-11799-2_17",

language = "English (US)",

isbn = "3642117988",

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

pages = "273--289",

booktitle = "Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings",

note = "7th Theory of Cryptography Conference, TCC 2010 ; Conference date: 09-02-2010 Through 11-02-2010",

}

TY - GEN

T1 - A domain extender for the ideal cipher

AU - Coron, Jean Sébastien

AU - Dodis, Yevgeniy

AU - Mandal, Avradip

AU - Seurin, Yannick

PY - 2010

Y1 - 2010

N2 - We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construction is based on a 3-round Feistel, and is more efficient than first building a n-bit random oracle from a n-bit ideal cipher (as in [9]) and then a 2n-bit ideal cipher from a n-bit random oracle (as in [10], using a 6-round Feistel). We also show that 2 rounds are not enough for indifferentiability by exhibiting a simple attack. We also consider our construction in the standard model: we show that 2 rounds are enough to get a 2n-bit tweakable block-cipher from a n-bit tweakable block-cipher and we show that with 3 rounds we can get beyond the birthday security bound.

AB - We describe the first domain extender for ideal ciphers, i.e. we show a construction that is indifferentiable from a 2n-bit ideal cipher, given a n-bit ideal cipher. Our construction is based on a 3-round Feistel, and is more efficient than first building a n-bit random oracle from a n-bit ideal cipher (as in [9]) and then a 2n-bit ideal cipher from a n-bit random oracle (as in [10], using a 6-round Feistel). We also show that 2 rounds are not enough for indifferentiability by exhibiting a simple attack. We also consider our construction in the standard model: we show that 2 rounds are enough to get a 2n-bit tweakable block-cipher from a n-bit tweakable block-cipher and we show that with 3 rounds we can get beyond the birthday security bound.

KW - Ideal cipher model

KW - Indifferentiability

KW - Tweakable block-cipher

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

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

U2 - 10.1007/978-3-642-11799-2_17

DO - 10.1007/978-3-642-11799-2_17

M3 - Conference contribution

AN - SCOPUS:77949598897

SN - 3642117988

SN - 9783642117985

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

SP - 273

EP - 289

BT - Theory of Cryptography - 7th Theory of Cryptography Conference, TCC 2010, Proceedings

T2 - 7th Theory of Cryptography Conference, TCC 2010

Y2 - 9 February 2010 through 11 February 2010

ER -

A domain extender for the ideal cipher

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this