You are looking at a specific version 20080429:183902 of this paper. See the latest version.

Paper 2008/012

The Encrypted Elliptic Curve Hash

Daniel R. L. Brown

Abstract

Bellare and Micciancio's MuHASH applies a pre-existing hash function to map indexed message blocks into a secure group. The resulting hash is the product. Bellare and Micciancio proved, in the random oracle model, that MuHASH is collision-resistant if the group's discrete logarithm problem is infeasible. MuHASH, however, relies on a pre-existing hash being collision resistant. In this paper, we remove such a reliance by replacing the pre-existing hash with a block cipher under a fixed key. We adapt Bellare and Micciancio's collision-resistance proof to the ideal cipher model. Preimage resistance requires us to add a further modification.

Note: Now cited Ristenpart and Shrimpton

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Hash functioncollision resistance
Contact author(s)
dbrown @ certicom com
History
2008-04-29: last of 2 revisions
2008-01-14: received
See all versions
Short URL
https://ia.cr/2008/012
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.