Compression Functions Suitable for the Multi-Property-Preserving Transform

Hidenori KUWAKADO  Masakatu MORII  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E91-A   No.10   pp.2851-2859
Publication Date: 2008/10/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e91-a.10.2851
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Cryptography and Information Security
Keyword: 
compression function,  hash function,  multi-property preserving,  

Full Text: PDF(195.8KB)>>
Buy this Article




Summary: 
Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to that of the construction for multi-property compression functions. However, the Davies-Meyer compression function that is commonly used for standard hash functions is not a multi-property compression function. That is, in the ideal cipher model, the Davies-Meyer compression function is collision resistant, but it is not indifferentiable from a random oracle. In this paper, we show that the compression function proposed by Lai and Massey is a multi-property compression function. In addition, we show that the simplified version of the Lai-Massey compression function is also a multi-property compression function. The use of these compression functions enables us to construct multi-property hash functions by the multi-property preserving domain extension transform.