
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Connections among Several Versions of OneWay Hash Functions
Yuliang ZHENG Tsutomu MATSUMOTO Hideki IMAI
Publication
IEICE TRANSACTIONS (19761990)
Vol.E73
No.7
pp.10921099 Publication Date: 1990/07/25
Online ISSN:
DOI:
Print ISSN: 00000000 Type of Manuscript: Special Section PAPER (Special Issue on Cryptography and Information Security) Category: Authentication Techniques Keyword:
Full Text: PDF(772.7KB)>>
Summary:
We study the following two kinds of oneway hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initialstring 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 xy of strings such that x collides with y. Our main results are as follows. First we prove that UOHs with respect to initialstrings chosen arbitrarily exist if and only if UOHs with respect to initialstrings chosen uniformly at random exist. Then, as an application of the result, we show that UOHs with respect to initialstrings chosen arbitrarily can be constructed under a weaker assumption, the existence of oneway quasiinjections. Finally, we investigate relationships among different versions of oneway hash functions. We prove that some versions of oneway hash functions are strictly included in others by explicitly constructing hash functions that are oneway in the sense of the former but not in the sense of the latter.

