Skip to main content
Article thumbnail
Location of Repository

Amplifying Collision Resistance: A Complexity-Theoretic Treatment

By Ran Canetti, Ron Rivest, Madhu Sudan, Luca Trevisan, Salil Vadhan and Hoeteck Wee

Abstract

Abstract. We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functions into strongly collision-resistant ones in the standard model of computation. We measure the level of collision resistance by the maximum probability, over the choice of the key, for which an efficient adversary can find a collision. The goal is to obtain constructions with short output, short keys, small loss in adversarial complexity tolerated, and a good trade-off between compression ratio and computational complexity. We provide an analysis of several simple constructions, and show that many of the parameters achieved by our constructions are almost optimal in some sense

Topics: hash functions, hardness amplification, combiners
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.9379
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://theory.lcs.mit.edu/~mad... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.