A New Tree based Domain Extension of UOWHF

Construction of UOWHF: Two New Parallel Methods

We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar’s construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup’s sequential algorithm. But it is...

New Parallel Domain Extenders for UOWHF

We present two new parallel algorithms for extending the domain of a UOWHF. The first algorithm is complete binary tree based construction and has less key length expansion than Sarkar’s construction which is the previously best known complete binary tree based construction. But only disadvantage is that here we need more key length expansion than that of Shoup’s sequential algorithm. But it is...

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions

This paper presents the Generalized Randomized Iterate of a (regular) one-way function f and show that it can be used to build Universal One-Way Hash Function (UOWHF) families with O(n) key length. We then show that Shoup’s technique for UOWHF domain extension can be used to improve the efficiency of the previous construction. We present the Reusable Generalized Randomized Iterate which consist...

Domain Extenders for UOWHF: A Generi Lower Bound on Key Expansion and a Finite Binary Tree Algorithm

Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damg̊ard domain extender. However, they did not provide any provably secure constructions f...