Necessary and sufficient conditions for collision-free hashing
- Alexander Russell
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
This paper determines an exact relationship between collision-free hash functions and other cryptographic primitives. Namely, it introduces a new concept, the pseudopermutation, and shows that the existence of collision-free hash functions is equivalent to the existence of claw-free pairs of pseudopermutations. We also give a simple construction of collision-free hash functions from everywhere-defined claw-free (pseudo-) permutations.
- M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal of Computing, 13(4):850–864, November 1984.
- I. Damgård. Collision free hash functions and public key signature schemes. Proceedings of EUROCRYPT '87, Lecture Notes in Computer Science, pages 203–216, volume 304, Springer-Verlag, Berlin, 1988.
- A. De Santis and M. Yung. On the design of provably-secure cryptographic hash functions. Proceedings of EUROCRYPT '90, Lecture Notes in Computer Science, pages 412–431, volume 473, Springer-Verlag, Berlin, 1990.
- O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, October 1986.
- S. Goldwasser, S. Micali, and R. L. Rivest. A digital signature scheme secure against adaptive chosen-message attack. SIAM Journal of Computing, 17(2):281–308, April 1988.
- J. Håstad. Pseudo-random generators under uniform assumptions. Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pages 395–404, 1990.
- R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 12–24, 1989.
- T. Itoh. Personal communication, August 1992.
- J. Kilian. A note on efficient zero-knowledge proofs and arguments. Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pages 723–732, 1992.
- M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 33–43, 1989.
- W. Ogata and K. Kurosawa. On claw free families. Proceedings of ASIACRYPT '91, pages 111–123, 1991.
- J. Rompel. One-way functions are necessary and sufficient for secure signatures. Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pages 387–394, 1990.
- A. Yao. Theory and applications of trapdoor functions. Proceedings of the Twenty-Third IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.
- Y. Zheng, T. Matsumoto, and H. Imai. Duality between two cryptographic primitives. Proceedings of the Eighth International Conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, pages 379–390, volume 508, Springer-Verlag, Berlin, 1990.
- Y. Zheng, T. Matsumoto, and H. Imai. Structural properties of one-way hash functions. Proceedings of CRYPTO '90, Lecture Notes in Computer Science, pages 285–302, volume 537, Springer-Verlag, Berlin, 1990.
- Necessary and sufficient conditions for collision-free hashing
Journal of Cryptology
Volume 8, Issue 2 , pp 87-99
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Hash functions
- Industry Sectors
- Author Affiliations
- 1. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, 02139, Cambridge, MA, USA