Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext… Expand

Is this relevant?

2012

2012

Cryptographic Hash functions are used to achieve a number of security objectives. In this paper, we bring out the importance of… Expand

Is this relevant?

2011

2007

2007

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

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

Highly Cited

1999

Highly Cited

1999

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

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

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?