Abstract
We present a simple, new paradigm for the design of collision-free hash functions. Any function emanating from this paradigm is incremental. (This means that if a message x which I have previously hashed is modified to x′ then rather than having to re-compute the hash of x′ from scratch, I can quickly “update” the old hash value to the new one, in time proportional to the amount of modification made in x to get x′.) Also any function emanating from this paradigm is parallelizable, useful for hardware implementation. We derive several specific functions from our paradigm. All use a standard hash function, assumed ideal, and some algebraic operations. The first function, MuHASH, uses one modular multiplication per block of the message, making it reasonably efficient, and significantly faster than previous incremental hash functions. Its security is proven, based on the hardness of the discrete logarithm problem. A second function, AdHASH, is even faster, using additions instead of multiplications, with security proven given either that approximation of the length of shortest lattice vectors is hard or that the weighted subset sum problem is hard. A third function, LtHASH, is a practical variant of recent lattice based functions, with security proven based, again on the hardness of shortest lattice vector approximation.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Ajtai, “Generating hard instances of lattice problems,” Proceedings of the 28th Annual Symposium on Theory of Computing, ACM, 1996.
M. Bellare, O. Goldreich and S. Goldwasser, “Incremental cryptography: The case of hashing and signing,” Advances in Cryptology — Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
M. Bellare, O. Goldreich and S. Goldwasser, “Incremental cryptography with application to virus protection,” Proceedings of the 27th Annual Symposium on Theory of Computing, ACM, 1995.
M. Bellare and D. Micciancio, “A new paradigm for collision-free hashing: Incrementality at reduced cost,” full version of this paper, available at http://www-cse.ucsd.edu/users/mihir.
M. Bellare, R. Guérin and P. Rogaway, “XOR MAcs: New methods for message authentication using finite pseudorandom functions,” Advances in Cryptology — Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
M. Bellare and P. Rogaway, “Random oracles are practical: A paradigm for designing efficient protocols,” Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.
D. Coppersmith, “Two Broken Hash Functions,” IBM Research Report RC-18397, IBM Research Center, Yorktown Heights, NY, October 1992.
D. Coppersmith and B. Preneel, “Comments on MASH-1 and MASH-1,” Manuscript, February 1995.
D. Chaum, E. Heijst and B. Pfitzmann, “Cryptographically strong undeniable signatures, unconditionally secure for the signer,” Advances in Cryptology — Crypto 91 Proceedings, Lecture Notes in Computer Science Vol. 576, J. Feigenbaum ed., Springer-Verlag, 1991.
T. Cormen, C. Leiserson and R. Rivest, “Introduction to Algorithms,” McGraw-Hill, 1992.
I. Damgard “Collision Free Hash Functions and Public Key Signature Schemes,” Advances in Cryptology — Eurocrypt 87 Proceedings, Lecture Notes in Computer Science Vol. 304, D. Chaum ed., Springer-Verlag, 1987.
I. Damgard “A Design Principle for Hash Functions,” Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
H. Dobbertin, A. Bosselaers and B. Preneel, “RIPEMD-160: A strengthened version of RIPEMD,” Fast Software Encryption, Lecture Notes in Computer Science 1039, D. Gollmann, ed., Springer-Verlag, 1996.
M. Girault, “Hash functions using modulo-N operations,” Advances in Cryptology — Eurocrypt 87 Proceedings, Lecture Notes in Computer Science Vol. 304, D. Chaum ed., Springer-Verlag, 1987.
O. Goldreich, S. Goldwasser and S. Halevi, “Collision-Free Hashing from Lattice Problems,” Theory of Cryptography Library (http://theory.lcs.mit.edu/~tcryptol/) 96–09, July 1996.
S. Goldwasser, S. Micali and R. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM Journal of Computing, Vol. 17, No. 2, pp. 281–308, April 1988.
R. Impagliazzo and M. Naor, “Efficient cryptographic schemes provably as secure as subset sum,” Proceedings of the 30th Symposium on Foundations of Computer Science, IEEE, 1989.
R. Impagliazzo and M. Naor, “Efficient cryptographic schemes provably as secure as subset sum,” Journal of Cryptology, Vol. 9, No. 4, Autumn 1996.
A. Lenstra, H. Lenstra and L. Lovász, “Factoring polynomials with rational coefficients,” Mathematische Annalen Vol. 261, pp. 515–534, 1982.
A. Menezes, P. Van Oorschot and S. Vanstone, “Handbook of Applied Cryptography,” CRC Press, 1996.
R. Merkle “One Way Hash Functions and DES,” Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
D. Micciancio, “Oblivious data structures: applications to cryptography,” Proceedings of the 29th Annual Symposium on Theory of Computing, ACM, 1997.
M. Naor and M. Yung, “Universal one-way hash functions and their cryptographic applications,” Proceedings of the 21st Annual Symposium on Theory of Computing, ACM, 1989.
A. Odlyzko, “The rise and fall of knapsack cryptosystems,” Advances in computational number theory, C. Pomerance ed., Proc. Symp. Applied Math No. 42, pp. 75–88, AMS, 1990.
B. Preneel, R. Govaerts and J. Vandewalle, “Hash functions based on block ciphers: a synthetic approach,” Advances in Cryptology — Crypto 93 Proceedings, Lecture Notes in Computer Science Vol. 773, D. Stinson ed., Springer-Verlag, 1993.
R. Rivest, “The MD5 Message-Digest Algorithm,” IETF RFC 1321, April 1992.
J. Rosser and L. Schoenfeld, “Approximate formulas for some functions of prime numbers,” Illinois Journal of Math Vol. 6, 1962.
C. Schnorr and H. Hörner, “Attacking the Chor-Rivest cryptosystem with improved lattice reduction,” Advances in Cryptology — Eurocrypt 95 Proceedings, Lecture Notes in Computer Science Vol. 921, L. Guillou and J. Quisquater ed., Springer-Verlag, 1995.
FIPS 180-1. “Secure Hash Standard,” Federal Information Processing Standard (FIPS), Publication 180-1, National Institute of Standards and Technology, US Department of Commerce, Washington D.C., April 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Micciancio, D. (1997). A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_13
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive