Reference : A Domain Extender for the Ideal Cipher
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/12501
A Domain Extender for the Ideal Cipher
English
Coron, Jean-Sébastien mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Dodis, Yevgeniy [New York University]
Mandal, Avradip [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Seurin, Yannick [Orange Labs]
2010
Proceedings of TCC 2010
Springer
273-289
Yes
978-3-642-11798-5
TCC
9-11 février 2010
Zurich
Switzerland
[en] 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.
http://hdl.handle.net/10993/12501
5978
Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
356.pdfPublisher postprint309.59 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.