Abstract
Recently, formal complexity-theoretic treatment of cryptographic hash functions was suggested. Two primitives of Collision-free hash functions and Universal one-way hash function families have been defined. The primitives have numerous applications in secure information compression, since their security implies that finding collisions is computationally hard. Most notably, Naor and Yung have shown that the most secure signature scheme can be reduced to the existence of universal one-way hash (this, in turn, gives the first trapdoor-less provably secure signature scheme).
In this work, we first present reductions from various one-way function families to universal one-way hash functions. Our reductions are general and quite efficient and show how to base universal one-way hash functions on any of the known concrete candidates for one-way functions. We then show equivalences among various definitions of hardness for collision-free hash functions.
Part of this work was done while the author was visiting IBM Research Division, T. J. Watson Research Ctr, Yorktown Heights, NY 10598.
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
Bellare M. and S. Micali, How to Sign Given any Trapdoor Function, Proceedings of the 20th Annual Symposium on the Theory of Computing, Chicago, II, 1988, pp. 32–42.
J. L. Carter and M. N. Wegman, Universal Classes of Hash Functions, Journal of Computer and System Sciences 18 (1979), pp. 143–154.
I. B. Damgård, Collision Free Hash Functions and Public Key Signature Schemes, Eurocrypt 1987.
W. Diffie and Hellman, New Directions in Cryptography, IEEE Trans. on Information Theory, vol. IT-22,6 (1976), pp. 644–654.
P. Elias, Universal Codeword Sets and Representations of the Integers, IEEE Trans. on Inform. Theory, vol. 21, n. 2, March 1975, pp. 194–203.
M. Girault, Hash-functions using modulo-N Operations, Eurocrypt, 1987.
O. Goldreich, Two Remarks Concerning the GMR Signature Scheme, Crypto 1986.
O. Goldreich, H. Krawczyk, and M. Luby, On the existence of Pseudorandom Generators, Proceedings of the 29th Symposium on the Foundation of Computer Science, 1988, pp. 12–24.
S. Goldwasser, S. Micali, and R. Rivest, A secure digital signature scheme, Siam Journal on Computing, Vol. 17,2 (1988), pp. 281–308.
S. Goldwasser, S. Micali, and A. C. Yao, Strong signature schemes, Proceedings of the 15th Annual Symposium on the Theory of Computing, Boston, MA, 1983, pp. 431–439.
R. Impagliazzo, L. Levin, and M. Luby, Pseudo-Random Generation from One-way Functions, Proceedings of 21st STOC, May 1989.
R. Impagliazzo and M. Luby, One-way Functions are Essential for Complexity Based Cryptography, Proceedings of the 30th Symposium on the Foundation of Computer Science, 1989.
R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably secure as Subset Sum, Proceedings of the 30th Symposium on the Foundation of Computer Science, 1989.
L. Lamport, Constructing digital signatures from one-way functions, SRI intl. CSL-98, October 1979.
R. Merkle, A Digital Signature based on Conventional Encryption Function, Crypto 1987, Springer Verlag.
R. Merkle, Secrecy, Authentication and Public Key Systems, Ph.D. Thesis (1982), UMI Research Press, Ann Arbor, Michigan.
R. Merkle, One-way Hash Functions and DES, Crypto 1989.
R. Merkle and M. Hellman, Hiding Information and Signature in Trapdoor Knapsack, IEEE Trans. on Inform. Theory, vol. 24, n. 5, 1978, pp. 525–530.
M. Naor and M. Yung, Universal One-way Hash Functions and their Cryptographic Applications, Proceedings of 21st STOC, May 1989.
M. O. Rabin, Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM-212, Lab. for Computer Science, MIT, 1979.
J. Rompel, One-way Functions are Necessary and Sufficient for Signature, STOC 90.
R. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of ACM, 21 (1978), pp. 120–126.
A. C. Yao, Theory and Applications of Trapdoor functions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Santis, A., Yung, M. (1991). On the Design of Provably-Secure Cryptographic Hash Functions. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_37
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive