International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers

Authors:
Joan Daemen , Digital Security Group, Radboud University, Nijmegen
Bart Mennink , Digital Security Group, Radboud University, Nijmegen
Gilles Van Assche , STMicroelectronics, Diegem
Download:
DOI: 10.13154/tosc.v2018.i4.197-228
URL: https://tosc.iacr.org/index.php/ToSC/article/view/7366
Search ePrint
Search Google
Presentation: Slides
Abstract: Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this work we provide three simple proofs, one per primitive type, that cover all modes where the input to the primitive consists of message bits, chaining value bits, and bits that only depend on the mode and message length. Our approach generalizes and simplifies over earlier attempts of Dodis et al. (FSE 2009) and Bertoni et al. (Int. J. Inf. Sec. 2014). We prove tight indifferentiability bounds for modes using each of these three primitive types provided that the mode satisfies some easy to verify conditions.
Video from TOSC 2018
Video provided under Creative Commons / CC BY 3.0
BibTeX
@article{tosc-2018-29251,
  title={Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers},
  journal={IACR Transactions on Symmetric Cryptology},
  publisher={Ruhr-Universität Bochum},
  volume={2018, Issue 4},
  pages={197-228},
  url={https://tosc.iacr.org/index.php/ToSC/article/view/7366},
  doi={10.13154/tosc.v2018.i4.197-228},
  author={Joan Daemen and Bart Mennink and Gilles Van Assche},
  year=2018
}