Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

EUROCRYPT
2000
Springer

favoriteEmaildiscussreport

131views Cryptology» more EUROCRYPT 2000»

A Composition Theorem for Universal One-Way Hash Functions

14 years 2 months ago

A Composition Theorem for Universal One-Way Hash Functions

Download www.zurich.ibm.com

In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed-length messages. The new construction is extremely simple and is also very efficient, yielding shorter keys than previously proposed composition constructions.

Victor Shoup

Real-time Traffic

Cryptology | EUROCRYPT 2000 | One-way Hash Functions | Universal One-way Hash | Yielding Shorter Keys |

claim paper

Related Content

» Higher Order Universal OneWay Hash Functions

» Universal OneWay Hash Functions via Inaccessible Entropy

» Limits on the Efficiency of OneWay PermutationBased Hash Functions

» Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class The Case of Large Universe...

» Domain Extension for Enhanced Target CollisionResistant Hash Functions

» New notions of security achieving universal composability without trusted setup

» GNUC A New Universal Composability Framework

» General Composition and Universal Composability in Secure MultiParty Computation

» Trading Static for Adaptive Security in Universally Composable ZeroKnowledge

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	EUROCRYPT
Authors	Victor Shoup

Comments (0)