Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Universal one-way hash function

Known as: UOWHF, Unversal one-way hash function 
In cryptography a universal one-way hash function (UOWHF, often pronounced "woof"), is a type of universal hash function of particular importance to… Expand
Wikipedia

Related topics

Related topics

7 relations
Cryptographic hash functionCryptographyList of hash functionsMerkle signature scheme
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions
We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext… Expand
Is this relevant?
2012
2012
Universal One Way Hash Functions ( UOWHF )
Cryptographic Hash functions are used to achieve a number of security objectives. In this paper, we bring out the importance of… Expand
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2011
2011
Universal One-Way Hash Functions (UOWHF)
  • Bart Preneel
  • Encyclopedia of Cryptography and Security
  • 2011
    • Corpus ID: 33130287
 
Is this relevant?
2007
2007
Construction of universal one-way hash functions: Tree hashing revisited
We present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t≥2… Expand
Is this relevant?
2005
2005
How to Construct Universal One-Way Hash Functions of Order r
At ASIACRYPT 2004, Hong et al. introduced the notion of UOWHFs of order r > 0. A UOWHF has the order r if it is infeasible for… Expand
Is this relevant?
2002
2002
Construction of UOWHF: Tree Hashing Revisited
 
Is this relevant?
2002
2002
Constru tion of UOWHF : Tree Hashing
  • T. B., RoadKolkata
  • 2002
    • Corpus ID: 12975662
 
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Limits on the efficiency of one-way permutation-based hash functions
Naor and Yung (1989) show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one… Expand
Is this relevant?
1990
1990
On the Design of Provably Secure Cryptographic Hash Functions
Recently, formal complexity-theoretic treatment of cryptographic hash functions was suggested. Two primitives of Collision-free… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Universal one-way hash functions and their cryptographic applications
We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE