CryptoDB
Adaptive Preimage Resistance and Permutation-based Hash Functions
Authors: | |
---|---|
Download: | |
Abstract: | In this paper, we introduce a new notion of security, called adaptive preimage resistance. We prove that a compression function that is collision resistant and adaptive preimage resistant can be combined with a public random function to yield a hash function that is indifferentiable from a random oracle. Specifically, we analyze adaptive preimage resistance of 2n-bit to n-bit compression functions that use three calls to n-bit public random permutations. By using such compression functions as building blocks, we obtain a method for construction of permutation-based pseudorandom oracles that is comparable to the Sponge construction [4] both in terms of security and efficiency. |
BibTeX
@misc{eprint-2009-18190, title={Adaptive Preimage Resistance and Permutation-based Hash Functions}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / hash functions}, url={http://eprint.iacr.org/2009/066}, note={ jlee05@ensec.re.kr 14301 received 9 Feb 2009, last revised 26 Feb 2009}, author={Jooyoung Lee and Je Hong Park}, year=2009 }