[Resource Topic] 2018/547: Indifferentiable Authenticated Encryption

Welcome to the resource topic for 2018/547

Indifferentiable Authenticated Encryption

Authors: Manuel Barbosa, Pooya Farshim


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

ePrint: https://eprint.iacr.org/2018/547

Talk: https://www.youtube.com/watch?v=jEViuJ47im0

Slides: https://crypto.iacr.org/2018/slides/Indifferentiable%20Authenticated%20Encryption.pdf

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .