Collision Resistance of Hash Functions in a Weak Ideal Cipher Model

Shoichi HIROSE, Hidenori KUWAKADO
2012 IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences  
This article discusses the provable security of blockcipher-based hash functions. It introduces a new model called a weak ideal cipher model. In this model, an adversary is allowed to make key-disclosure queries to the oracle as well as encryption and decryption queries. A key-disclosure query is a pair of a plaintext and a ciphertext, and the reply is a corresponding key. Thus, in this model, a block cipher is random but completely insecure as a block cipher. It is shown that collision
more » ... t hash functions can be constructed even in this weak model.
doi:10.1587/transfun.e95.a.252 fatcat:c22mqie2pzhu5gfa6d5o6wxvpi