Perfectly One-Way Probabilistic Hash Functions

Perfectly One-Way Probabilistic Hash Functions (1998)

by Ran Canetti , Daniele Micciancio , Omer Reingold

Citations:

53 - 5 self

User correction supplied by mph

Datum	Value	Source
TITLE	Perfectly One-Way Probabilistic Hash Functions	user correction - Legacy Corrections
AUTHOR NAME	Ran Canetti	user correction
AUTHOR AFFIL	IBM T.J. Watson Research Center	user correction
AUTHOR NAME	Daniele Micciancio	user correction
AUTHOR AFFIL	MIT Laboratory for Computer Science	user correction
AUTHOR NAME	Omer Reingold	user correction
ABSTRACT	Probabilistic hash functions that hide all partial information on their input were recently introduced. This new cryptographic primitive can be regarded as a function that offers "perfect one-wayness", in the following sense: Having access to the function value on some input is equivalent to having access only to an oracle that answers "yes" if the correct input is queried, and answers "no" otherwise. Constructions of this primitive (originally called oracle hashing and here re-named perfectly one-way functions) were given based on certain strong variants of the Diffie-Hellman assumption. In this work we present several constructions of perfectly one-way functions; some constructions are based on claw-free permutation, and others are based on any one-way permutation. One of our constructions is simple and efficient to the point of being attractive from a practical point of view.	user correction
YEAR	1998	user correction
CITATIONS	16 found	ParsCit 1.0