Necessary and sufficient conditions for collision-free hashing

@article{Russell2004NecessaryAS,
  title={Necessary and sufficient conditions for collision-free hashing},
  author={Alexander Russell},
  journal={Journal of Cryptology},
  year={2004},
  volume={8},
  pages={87-99}
}
  • A. Russell
  • Published 16 August 1992
  • Mathematics, Computer Science
  • Journal of Cryptology
This paper determines an exact relationship between collision-free hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collision-free hash functions is equivalent to the existence of claw-free pairs of pseudopermutations. We also give a simple construction of collision-free hash functions from everywhere-defined claw-free (pseudo-) permutations. 
View on Springer
link.springer.com
5 Citations
Highly Influential Citations
1
Background Citations
2

5 Citations

Sufficient Conditions for Collision-Resistant Hashing
TLDR
Several new constructions of collision-resistant hash-functions (CRHFs) from general assumptions are presented, including constructions from two other primitives that are implied by homomorphic-encryption: one-round private information retrieval (PIR) protocols and homomorphic one-way commitments.
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
TLDR
Black-box separations demonstrate that constructions from one-way functions are unlikely, and theoretical constructions of collision-resistant hash functions are based on rather structured assumptions.
Hash Functions: From Merkle-Damgård to Shoup
TLDR
A continuum of function classes that lie between universal one-way hash functions and collision-resistant functions is introduced, and it is proved that the schedule of the Shoup construction is optimal.
Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?
We prove the existence of an oracle relative to which there exist several well-known cryptographic primitives, including one-way permutations, but excluding (for a suitably strong definition)…
Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
TLDR
The relationship between public-coin and secret-coin collision-resistant hash function families (CRHFs) is studied and it is demonstrated that public coins used in parameter generation are collision- resistant.
Formalizing Human Ignorance: Collision-Resistant Hashing without the Keys
  • P. Rogaway
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2006
TLDR
A simple way to sidestep this difficulty that avoids having to key the authors' hash functions is explained, to state theorems in a way that prescribes an explicitly-given reduction, normally a black-box one.
The State of Cryptographic Hash Functions
  • B. Preneel
  • Computer Science, Mathematics
    Lectures on Data Security
  • 1998
TLDR
The state of the art for cryptographic hash functions is described, different definitions are compared, and the few theoretical results on hash functions are discussed.
HASHSORT - A NOVEL HASHING FUNCTION BASED ON SORTING TECHNIQUE TO RESOLUTE COLLISION
TLDR
This paper proposes a novel hash table implementa tion called Hashsort function, which reduces the collisions, such that automatically increase the access time in the hash table.
On Provably Secure Time-Stamping Schemes
TLDR
It is observed that if the variety of possible shapes of hash-chains is polynomial, then the time-stamping scheme becomes provably secure, assuming that the underlying hash function is collision-resistant, and it is shown that conventional black-box techniques are unable to prove that chain-resistance follows from collision-Resistance.
Perfect Hashing with Pseudo-minimal Bottom-up Deterministic Tree Automata
TLDR
This work describes a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA) and provides procedures to build incrementally the pseudo-minimal DTA and the associated hash codes.