Domain Extenders for UOWHF: A Generic Lower Bound on Key Expansion And Finite Binary Tree Algorithm (2003)

Cached

Download Links

by Palash Sarkar
Citations:6 - 1 self

Documents Related by Co-Citation

16 Hash Functions: From Merkle-Damgård to Shoup – Ilya Mironov - 2001
45 A composition theorem for universal one-way hash functions – Victor Shoup - 2000
98 Collision-resistant hashing: Towards making UOWHFs practical – Mihir Bellare, Philip Rogaway - 1997
289 A Design Principle for Hash Functions – Ivan Damg˚ard - 1990
313 Universal One-Way Hash Functions and their Cryptographic Applications – Moni Naor, Moti Yung - 1989
72 Finding Collisions on a One-Way Street: Can Secure Hash Functions be Based on General Assumptions – Daniel R. Simon - 1998
175 One way hash functions and DES – R Merkle - 1990
4 Construction of UOWHF: Tree Hashing Revisited,” Cryptology ePrint Archive – P Sarkar
3 A New Tree based Domain Extension of UOWHF, Cryptology e-print archive – M Nandi
2 Construction of UOWHF : Tree Hashing Revisited . IACR preprint server – P Sarkar
3 New Parallel Domain Extenders for UOWHF – Wonil Lee, Donghoon Chang, Sangjin Lee, Soohak Sung, Mridul Nandi
2 Study of domain extension of UOWHF and its optimality,” Cryptology ePrint Archive – M Nandi
48 One way hash functions and – R C Merkle - 1989
2 New parallel domain extenders for – W Lee, D Chang, S Lee, S Sung, M Nandi - 2003
28 Some Observations on the Theory of Cryptographic Hash Functions – D.R. Stinson - 2001
35 One-Way Functions are Necessary and Su cient for Secure Signatures – J Rompel - 1990
78 Efficient Cryptographic Schemes Provably as Secure as Subset Sum – Russell Impagliazzo, Moni Naor - 1993
47 The State of Cryptographic Hash Functions – Bart Preneel - 1994
1 A New Tree based Domain Extension of UOWHF. IACR e-print server http://eprint.iacr.org/2003/142 – M Nandi