See this document in CiteSeerX!

A Sufficient Condition and an Optimal Domain Extension of UOWHF (2004)  (Make Corrections)  
Mridul Nandi



  Home/Search   Context   Related

 
View or download:
iacr.org/2003/158.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iacr.org/search...ast=183&title=1 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we will provide a non-trivial sufficient condition for UOWHF-preserving domain extension which will be very easy to verify. Using this result we can prove very easily that all known domain extension algorithms are valid. This will be a nice technique to prove a domain extension is valid. We also propose an optimal (w.r.t. both time complexity and key size) domain extension algorithm based on an incomplete binary tree. In Asiacrypt'03 [6] (also in [5]) author proposed a binary tree ... (Update)

Active bibliography (related documents):   More   All
1.4:   Masking Based Domain Extenders for UOWHFs: Bounds and Constructions - Sarkar (2003)   (Correct)
0.4:   Domain Extenders for UOWHF: A Generic Lower Bound on Key.. - Sarkar (2003)   (Correct)
0.4:   A New Tree Based Domain Extension of UOWHF - Nandi (2003)   (Correct)

Similar documents based on text:   More   All
0.4:   Construction of UOWHF: Tree Hashing Revisited - Sarkar (2002)   (Correct)
0.4:   Designs of Efficient Secure Large Hash Values - Nandi (2004)   (Correct)
0.3:   A Generalization of PGV-Hash Functions and.. - Lee, Nandi.. (2004)   (Correct)

BibTeX entry:   (Update)

@misc{ nandi-sufficient,
  author = "Mridul Nandi",
  title = "A Sufficient Condition and an Optimal Domain Extension of {UOWHF}",
  url = "citeseer.ist.psu.edu/nandi04sufficient.html" }
Citations (may not include all citations):
208   Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
77   One way hash functions and DES (context) - Merkle - 1990
45   Collision-resistant hashing: towards making UOWHFs practical (context) - Bellare, Rogaway - 1997
29   Finding collisions on a one-way street: Can secure hash func.. (context) - Simon - 1998
19   A composition theorem for universal one-way hash functions - Shoup
17   A design principle for hash functions (context) - Damg - 1990
10   Hash functions: from Merkle-Damgard to Shoup (context) - Mironov
5   Construction of UOWHF : Tree Hashing Revisited - Sarkar - 2002
2   New Parallel Domain Extenders for UOWHF (context) - Nandi, Lee et al.
2   A New Tree based Domain Extension of UOWHF - Nandi - 2003
1   A Practical Parallel Domain Extender for UOWHF (context) - Sarkar - 2003
http://eprint.iacr.org

Documents on the same site (http://eprint.iacr.org/search.pl?last=183&title=1):   More
Certificateless Public Key Cryptography - Al-Riyami, Paterson (2003)   (Correct)
Algebraic Attacks on Combiners with Memory and Several Outputs - Courtois (2003)   (Correct)
Using Information Theory Approach to Randomness Testing - Ryabko, Monarev (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC