Date Added: Jul 2012
In the recent years, several hash constructions have been introduced that aim at achieving enhanced security margins by strengthening the Merkle-Damgard mode. However, their security analysis have been conducted independently and using a variety of proof methodologies. This paper unifies these results by proposing a unique indifferentiability proof that considers a broadened form of the general compression function introduced by Stam at FSE09. This general definition enables the authors' to capture in a realistic model most of the features of the mode of operation (e.g., message encoding, blank rounds, message insertion,...) within the pre-processing and post-processing functions.