Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles

DOI10.1007/978-3-642-28496-0_20zbMath1292.94120OpenAlexW1419025060MaRDI QIDQ2889880

Yusuke Naito

Publication date: 8 June 2012

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28496-0_20

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Open problems in hash function security

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A synthetic indifferentiability analysis of some block-cipher-based hash functions
• Careful with Composition: Limitations of the Indifferentiability Framework
• MJH: A Faster Alternative to MDC-2
• On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Salvaging Merkle-Damgård for Practical Applications
• Security of Cyclic Double Block Length Hash Functions
• Another Glance at Double-Length Hashing
• Collision Resistant Double-Length Hashing
• The Collision Security of Tandem-DM in the Ideal Cipher Model
• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• Theory of Cryptography

This page was built for publication: Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles