New indifferentiability security proof of MDPH hash function

Abstract MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation. When instantiated with an n‐bit block cipher, Naito proved that this achieves the (ne...

Full description

Saved in:
Bibliographic Details
Main Authors: Chun Guo, Tetsu Iwata, Kazuhiko Minematsu
Format: Article
Language:English
Published: Wiley 2022-07-01
Series:IET Information Security
Subjects:
Online Access:https://doi.org/10.1049/ise2.12058
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832558687894372352
author Chun Guo
Tetsu Iwata
Kazuhiko Minematsu
author_facet Chun Guo
Tetsu Iwata
Kazuhiko Minematsu
author_sort Chun Guo
collection DOAJ
description Abstract MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation. When instantiated with an n‐bit block cipher, Naito proved that this achieves the (nearly) optimal indifferentiable security bound of O (n − log n)‐bit security. In this paper, the authors first point out that the proof of the claim contains a gap, which is related to the definition of the simulator in simulating the decryption of the block cipher. The authors then show that the proof can be fixed. The authors introduce a new simulator that addresses the issue, showing that MDPH retains its (nearly) optimal indifferentiable security bound of O (n − log n)‐bit security.
format Article
id doaj-art-cb8b640e52d24b41965f34faf9f9f294
institution Kabale University
issn 1751-8709
1751-8717
language English
publishDate 2022-07-01
publisher Wiley
record_format Article
series IET Information Security
spelling doaj-art-cb8b640e52d24b41965f34faf9f9f2942025-02-03T01:31:54ZengWileyIET Information Security1751-87091751-87172022-07-0116426228110.1049/ise2.12058New indifferentiability security proof of MDPH hash functionChun Guo0Tetsu Iwata1Kazuhiko Minematsu2School of Cyber Science and Technology Shandong University Qingdao Shandong ChinaNagoya University Nagoya JapanNEC Corporation Kawasaki JapanAbstract MDPH is a double‐block‐length hash function proposed by Naito at Latincrypt 2019. This is a combination of Hirose's compression function and the domain extender called Merkle–Damgård with permutation. When instantiated with an n‐bit block cipher, Naito proved that this achieves the (nearly) optimal indifferentiable security bound of O (n − log n)‐bit security. In this paper, the authors first point out that the proof of the claim contains a gap, which is related to the definition of the simulator in simulating the decryption of the block cipher. The authors then show that the proof can be fixed. The authors introduce a new simulator that addresses the issue, showing that MDPH retains its (nearly) optimal indifferentiable security bound of O (n − log n)‐bit security.https://doi.org/10.1049/ise2.12058cryptographyhash functionindifferentiabilityMDPH
spellingShingle Chun Guo
Tetsu Iwata
Kazuhiko Minematsu
New indifferentiability security proof of MDPH hash function
IET Information Security
cryptography
hash function
indifferentiability
MDPH
title New indifferentiability security proof of MDPH hash function
title_full New indifferentiability security proof of MDPH hash function
title_fullStr New indifferentiability security proof of MDPH hash function
title_full_unstemmed New indifferentiability security proof of MDPH hash function
title_short New indifferentiability security proof of MDPH hash function
title_sort new indifferentiability security proof of mdph hash function
topic cryptography
hash function
indifferentiability
MDPH
url https://doi.org/10.1049/ise2.12058
work_keys_str_mv AT chunguo newindifferentiabilitysecurityproofofmdphhashfunction
AT tetsuiwata newindifferentiabilitysecurityproofofmdphhashfunction
AT kazuhikominematsu newindifferentiabilitysecurityproofofmdphhashfunction