Structural Properties of One-way Hash Functions

We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initial-string x, it is computationally difficult to find a different string y that collides with x. And the main property of the latter is that it is computationally difficult to find a pair x = y of strings such that x collides with y. Our main results are as follows. First we prove that UOHs with respect to initial-strings chosen arbitrarily exist if and only if UOHs with respect to initial-strings chosen uniformly at random exist. Then, as an application of the result, we show that UOHs with respect to initial-strings chosen arbitrarily can be constructed under a weaker assumption, the existence of one-way quasi-injections. Finally, we investigate relationships among various versions of one-way hash functions. We prove that some versions of one-way hash functions are strictly included in...

• Type: Conference
• Year: 1990
• Where: CRYPTO
• Authors: Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
• Keywords: CRYPTO 1990, Cryptology, Hash Functions, Intractable Hash Functions, One-way Hash Functions