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

41 A composition theorem for universal one-way hash functions – Victor Shoup - 2000
88 P.: Collision-Resistant Hashing: Towards Making UOWHFs Practical – M Bellare, Rogaway - 1997
15 Hash Functions: From Merkle-Damgård to Shoup – Ilya Mironov - 2001
231 A design principle for hash functions – I Damgård - 1989
62 Finding Collisions on a One-Way Street: Can Secure Hash Functions be Based on General Assumptions – Daniel R. Simon - 1998
284 Universal One-Way Hash Functions and their Cryptographic Applications – Moni Naor, Moti Yung - 1989
138 One way hash functions and DES – R Merkle
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 New Parallel Domain Extenders for UOWHF – Wonil Lee, Donghoon Chang, Sangjin Lee, Soohak Sung, Mridul Nandi
2 Construction of UOWHF : Tree Hashing Revisited . IACR preprint server – P Sarkar
2 Study of domain extension of UOWHF and its optimality,” Cryptology ePrint Archive – M Nandi
41 One way hash functions and – R C Merkle - 1990
2 New parallel domain extenders for – W Lee, D Chang, S Lee, S Sung, M Nandi - 2003
39 The state of cryptographic hash functions – Bart Preneel, Cosic Katholieke, Hash Functions - 1999
34 One-way functions are necessary and su cient for secure signatures, STOC – J Rompel - 1990
23 Some Observations on the Theory of Cryptographic Hash Functions – D.R. Stinson - 2001
69 Efficient Cryptographic Schemes Provably as Secure as Subset Sum – Russell Impagliazzo, Moni Naor - 1993
1 A New Tree based Domain Extension of UOWHF. IACR e-print server http://eprint.iacr.org/2003/142 – M Nandi