CryptoDB
The Encrypted Elliptic Curve Hash
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-17689, title={The Encrypted Elliptic Curve Hash}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / Hash function, collision resistance}, url={http://eprint.iacr.org/2008/012}, note={ dbrown@certicom.com 13998 received 7 Jan 2008, last revised 29 Apr 2008}, author={Daniel R. L. Brown}, year=2008 }