PGV-style block-cipher-based hash families and black-box analysis

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 1, 2005, Pages 39-48

  Lee, Wonil ^a,c   Nandi, Mridul ^b,d   Sarkar, Palash ^b,e   Chang, Donghoon ^c   Lee, Sangjin ^c   Sakurai, Kouichi ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b INDIAN STATISTICAL INSTITUTE   (India)

^c Korea University   (South Korea)

^d Cryptology Research Group (CRG)   (India)

^e Indian Statistical Instute   (India)

Author keywords

Black box model; Block cipher; Hash function; Provable security

Indexed keywords

MATHEMATICAL MODELS; PUBLIC KEY CRYPTOGRAPHY;

BLACK-BOX MODEL; BLOCK CIPHER; HASH FUNCTION; PROVABLE SECURITY;

SECURITY OF DATA;

EID: 27544457324     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/E88-A.1.39     Document Type: Conference Paper

References (14)

1. J. Black, P. Rogaway, and T. Shrimpton, "Black-box analysis of the block-cipher-based hash function constructions from PGV," Advances in Cryptology-Crypto'02, Lecture Notes in Computer Science, vol.2442, pp.320-335, Springer-Verlag, 2002.
2. B. Preneel, R. Govaerts, and J. Vandewalle, "Hash functions based on block ciphers: A synthetic approach," Advances in Cryptology-CRYPTO'93, LNCS, pp.368-378, Springer-Verlag, 1994.
3. S. Even and Y. Mansour, "A construction of a cipher from a single pseudorandom permutation," Advances in Cryptology-ASIACRYPT'91, LNCS 739, pp.210-224, Springer-Verlag, 1992.
4. J. Kilian and P. Rogaway, "How to protect DES against exhaustive key search," J. Cryptology, vol.14, no.1, pp. 17-35, 2001. Earlier version in CRYPTO' 96.
5. R. Winternitz, "A secure one-way hash function built from DES," Proc. IEEE Symposium on Information Security and Privacy, pp.88-90, IEEE Press, 1984.
6. C. Shannon, "Communication theory of secrecy systems," Bell Syst. Tech. J., vol.28, no.4, pp.656-715, 1949.
7. M. Bellare and P. Rogaway, "Collision-resistant hashing: Towards making UOWHFs practical," Advances in Cryptology-Crypto'97, Lecture Notes in Computer Science, vol.1294, pp.470-484, Springer-Verlag, 1997.
8. I.B. Damgard, "A design principle for hash functions," Advances in Cryptology - Crypto'89, Lecture Notes in Computer Sciences, vol.435, pp.416-427, Springer-Verlag, 1989.
9. R. Merkle, "One way hash functions and DES," Advances in Cryptology - Crypto'89, Lecture Notes in Computer Sciences, vol.435, pp.428-446, Springer-Verlag, 1989.
10. I. Mironov, "Hash functions: From Merkle-Damgard to shoup," Advances in Cryptology - Eurocrypt'01, Lecture Notes in Computer Science, vol.2045, pp.166-181, Springer-Verlag, 2001.
11. M. Naor and M. Yung, "Universal one-way hash functions and their cryptographic applications," Proc. Twenty First Annual ACM Symposium on Theory of Computing, pp.33-43, ACM Press, 1989.
12. P. Sarkar, "Construction of UOWHF: Tree Hashing Revisited," Cryptology ePrint Archive, http://eprint.iacr.org/2002/058.
13. V. Shoup, "A composition theorem for universal one-way hash functions," Advances in Cryptology-Eurocrypt'00, Lecture Notes in Computer Science, vol.1807, pp.445-452, Springer-Verlag, 2000.
14. D. Simon, "Finding collisions on a one-way street: Can secure hash functions be based on general assumptions?," Advances in Cryptology - Eurocrypt'98, Lecture Notes in Computer Science, vol. 1403, pp.334-345, Springer-Verlag, 1998.