Structural properties of one-way hash functions

Structural properties of one-way hash functions (1991)

Cached

Download Links

[www.sis.uncc.edu]
[pscit-www.fcit.monash.edu.au]

Other Repositories/Bibliography

DBLP

by Yuliang Zheng , Tsutomu Matsumoto , Hideki Imai

Venue:	Advances in cryptology - CRYPTO 90, Lecture Notes in Computer Science
Citations:	13 - 5 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Structural properties of one-way hash functions	INFERENCE
AUTHOR NAME	Yuliang Zheng	SVM HeaderParse 0.2
AUTHOR AFFIL	Division of Electrical and Computer Engineering; Yokohama National University	SVM HeaderParse 0.2
AUTHOR ADDR	156 Tokiwadai, Hodogaya, Yokohama, 240 JAPAN	SVM HeaderParse 0.2
AUTHOR NAME	Tsutomu Matsumoto	SVM HeaderParse 0.2
AUTHOR AFFIL	Division of Electrical and Computer Engineering; Yokohama National University	SVM HeaderParse 0.2
AUTHOR ADDR	156 Tokiwadai, Hodogaya, Yokohama, 240 JAPAN	SVM HeaderParse 0.2
AUTHOR NAME	Hideki Imai	SVM HeaderParse 0.2
AUTHOR AFFIL	Division of Electrical and Computer Engineering; Yokohama National University	SVM HeaderParse 0.2
AUTHOR ADDR	156 Tokiwadai, Hodogaya, Yokohama, 240 JAPAN	SVM HeaderParse 0.2
ABSTRACT	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 others by explicitly constructing hash functions that are one-way in the sense of the former but not in the sense of the latter. 1	SVM HeaderParse 0.2
YEAR	1991	INFERENCE
VENUE	Advances in cryptology - CRYPTO 90, Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	285--302	INFERENCE
VOLUME	537	INFERENCE
CITATIONS	15 found	ParsCit 1.0