A composition theorem for universal one-way hash functions
From MaRDI portal
Publication:3374928
zbMATH Open1082.94531MaRDI QIDQ3374928FDOQ3374928
Authors: Victor Shoup 
Publication date: 1 March 2006
Recommendations
Cited In (24)
- On the Minimum Number of Multiplications Necessary for Universal Hash Functions
- How to Fill Up Merkle-Damgård Hash Functions
- A Three-Property-Secure Hash Function
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
- A combinatorial characterization of certain universal classes of hash functions
- Title not available (Why is that?)
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- On the ring-LWE and polynomial-LWE problems
- Higher order eTCR hash functions
- On the complexity of the herding attack and some related attacks on hash functions
- Title not available (Why is that?)
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- New second-preimage attacks on hash functions
- Higher Order Universal One-Way Hash Functions
- Security analysis of randomize-hash-then-sign digital signatures
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Title not available (Why is that?)
- Boosting Merkle-Damgård Hashing for Message Authentication
- Locally computable UOWHF with linear shrinkage
- Concealment and its applications to authenticated encryption
- Construction of universal one-way hash functions: tree hashing revisited
- Title not available (Why is that?)
This page was built for publication: A composition theorem for universal one-way hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374928)
