Paper 2024/706 Original: eprint.iacr.org/2024/706 ↗
Linicrypt in the Ideal Cipher Model
Abstract
We extend the Linicrypt framework for characterizing hash function security as proposed by McQuoid, Swope, and Rosulek (TCC 2018) to support constructions in the ideal cipher model. In this setting, we give a characterization of collision- and second-preimage-resistance in terms of a linear-algebraic condition on Linicrypt programs, and present an efficient algorithm for determining whether a program satisfies the condition. As an application, we consider the case of the block cipherbased hash functions proposed by Preneel, Govaerts, and Vandewall (Crypto 1993), and show that the semantic analysis of PGV given by Black et. al. (J. Crypto. 2010) can be captured as a special case of our characterization. In addition, We model hash functions constructed through the Merkle-Damgård transformation within the Linicrypt framework. Finally, we appy this model to an analysis of how various attacks on the underlying compression functions can compromise the collision resistance of the resulting hash function.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2024-05-07: last updated
- 2024-05-07: published
- Short URL
- https://ia.cr/2024/706
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2024/706,
author = {Zahra Javar and Bruce M. Kapron},
title = {Linicrypt in the Ideal Cipher Model},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/706},
year = {2024},
url = {https://eprint.iacr.org/2024/706}
}