Indifferentiable Authenticated Encryption - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

Indifferentiable Authenticated Encryption


We study Authenticated Encryption with Associated Data (AEAD) from the viewpoint of composition in arbitrary (single-stage) environments. We use the indifferentiability framework to formalize the intuition that a "good" AEAD scheme should have random ciphertexts subject to de-cryptability. Within this framework, we can then apply the indifferentiability composition theorem to show that such schemes offer extra safeguards wherever the relevant security properties are not known, or cannot be predicted in advance, as in general-purpose crypto libraries and standards. We show, on the negative side, that generic composition (in many of its configurations) and well-known classical and recent schemes fail to achieve indifferentiability. On the positive side, we give a provably indifferentiable Feistel-based construction, which reduces the round complexity from at least 6, needed for blockciphers, to only 3 for encryption. This result is not too far off the theoretical optimum as we give a lower bound that rules out the indifferentiability of any construction with less than 2 rounds.
Fichier principal
Vignette du fichier
547.pdf (1.41 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01904141 , version 1 (24-10-2018)



Manuel Barbosa, Pooya Farshim. Indifferentiable Authenticated Encryption. Advances in Cryptology – CRYPTO 2018, Aug 2018, Santa Barbara, United States. ⟨10.1007/978-3-319-96884-1_7⟩. ⟨hal-01904141⟩
75 View
194 Download



Gmail Facebook X LinkedIn More