Indifferentiable security analysis of popular hash functions with prefix-free padding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4284 LNCS, Issue , 2006, Pages 283-298

  Chang, Donghoon ^a   Lee, Sangjin ^a   Nandi, Mridul ^b   Yung, Moti ^c  

^a Korea University   (South Korea)

^b UNIVERSITY OF WATERLOO   (Canada)

^c Fu Foundation School of Engineering and Applied Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK LENGTHS; CONSTRUCTION STRATEGIES; FORMAL PROOFS; GENERIC ANALYSIS; IDEAL-CIPHER MODEL; INDIFFERENTIABILITY; INDISTINGUISHABILITY; PREFIX-FREE; RANDOM ORACLE MODEL; SECURITY ANALYSIS;

NETWORK SECURITY;

HASH FUNCTIONS;

EID: 77649256571     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_19     Document Type: Conference Paper

References (20)

1. M. Bellare and P. Rogaway. Random Oracles Are Practical : A Paradigm for Designing Efficient Protocols. In 1st Conference on Computing and Communications Security, ACM, pages 62-73. 1993.
2. J. Black, P. Rogaway, and T. Shrimpton. Black-box analysis of the blockcipher-based hash function constructions from PGV. In Advances in Cryptology-Crypto'2002, volume 2442 of Lecture Notes in Computer Science, pages 320-335. Springer-Verlag, 2002.
3. B. O. Brachtl, D. Coppersmith, M. M. Hyden, S. M. Matyas, C. H.Meyer, J. Oseas, S. Pilpel, and M. Schilling, "Data authentication using modification detection codes based on a public one way encryption function ," U.S. Patent Number 4,908,861, March 13, 1990.
4. L. Brown, J. Pieprzyk and J. Seberry. LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications. In Advances in Cryptology-Auscrypt'1990, volume 453 of Lecture Notes in Computer Science, pages 229-236. Springer-Verlag, 1990.
5. J. S. Coron, Y. Dodis, C.Malinaud and P. Puniya. Merkle-Damgard Revisited: How to Construct a Hash Function. In Advances in Cryptology-Crypto'2005, volume 3621 of Lecture Notes in Computer Science, pages 430-448. Springer-Verlag, 2005.
6. I. B. Damgard. A design principle for hash functions. In Advances in Cryptology-Crypto'1989, volume 435 of Lecture Notes in Computer Science, pages 416-427. Springer-Verlag, 1989.
7. S. Even, and Y. Mansour. A construction of a cipher from a single pseudorandom permutation. In Advances in Cryptology-Asiacrypt'1991, volume 739 of Lecture Notes in Computer Science, pages 210-224. Springer-Verlag, 1992.
8. S. Hirose. Provably Secure Double-Block-Length Hash Functions in a Black-Box Model. In ICISC'2004, volume 3506 of Lecture Notes in Computer Science, pages 330-342. Springer-Verlag, 2005.
9. S. Hirose. Some Plausible Constructions of Double-Block-Length Hash Functions. To appear in proceeding of FSE' 2006.
10. J. Kilian, and P. Rogaway. How to protect DES against exhaustive key search. In Journal of Cryptology, 14(1):17-35, 2001, Earlier version in CRYPTO' 96.
11. X. Lai and J. L. Massey. Hash Functions Based on Block Ciphers. In Advances in Cryptology-Eurocrypt'1992, volume 658 of Lecture Notes in Computer Science, pages 55-70. Springer-Verlag, 1993.
12. Stefan Lucks. A Failure-Friendly Design Principle for Hash Functions. In Advances in Cryptology-Asiacrypt'2005, volume 3788 of Lecture Notes in Computer Science, pages 474-494. Springer-Verlag, 2005.
13. U. Maurer, R. Renner and C. Holenstein. Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In TCC'2004, volume 2951 of Lecture Notes in Computer Science, pages 21-39. Springer-Verlag, 2004.
14. R. C. Merkle. One way hash functions and DES. In Advances in Cryptology-Crypto'1989, volume 435 of Lecture Notes in Computer Science, pages 428-446. Springer-Verlag, 1990.
15. Mridul Nandi. Towards Optimal Double-Length Hash Functions. In Indocrypt'2005, volume 3797 of Lecture Notes in Computer Science, pages 77-89. Springer-Verlag, 2005.
16. B. Preneel, A. Bosselaers, R. Govaerts and J. Vandewalle. Collision-free Hashfunctions Based on Blockcipher Algorithms. Proceedings of 1989 International Carnahan Conference on Security Technology, pages 203-210.
17. B. Preneel, R. Govaerts and J. Vandewalle. Hash Functions based on Block Ciphers : A Synthetic approach. In Advances in Cryptology-Crypto'1993, volume 773 of Lecture Notes in Computer Science, pages 368-378. Springer-Verlag, 1994.
18. J. J. Quisquater and M. Girault. 2n-bit Hash Functions Using n-bit Symmetric Block Cipher Algorithms. In Advances in Cryptology-Eurocrypt'1989, volume 434 of Lecture Notes in Computer Science, pages 102-109. Springer-Verlag, 1990.
19. C. Shannon. Communication theory of secrecy systems. Bell Systems Technical Journal, 28(4): pages 656-715, 1949.
20. R. Winternitz. A secure one-way hash function built from DES. In Proceedings of the IEEE Symposium on Information Security and Privacy, pages 88-90, 1984.