Optimal collision security in double block length hashing with single length key

DOI10.1007/S10623-016-0227-2zbMATH Open1381.94082OpenAlexW2413819851MaRDI QIDQ522211FDOQ522211

Authors: Bart Mennink 

Publication date: 13 April 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0227-2

Recommendations

• Optimal collision security in double block length hashing with single length key
• Another glance at double-length hashing
• Collision resistant double-length hashing
• Some Plausible Constructions of Double-Block-Length Hash Functions
• A New Double-Block-Length Hash Function Using Feistel Structure

zbMATH Keywords

indifferentiabilitycompression functioncollision resistancebeyond birthday bounddouble block lengthpreimage resistance

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Careful with composition: limitations of the indifferentiability framework
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Theory of Cryptography
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• A Failure-Friendly Design Principle for Hash Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Seven-Property-Preserving Iterated Hashing: ROX
• Fast Software Encryption
• Multi-property-preserving domain extension using polynomial-based modes of operation
• Towards Optimal Double-Length Hash Functions
• MJH: a faster alternative to MDC-2
• Blockcipher-Based Hashing Revisited
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Security of cyclic double block length hash functions
• Another glance at double-length hashing
• MJH: a faster alternative to MDC-2
• The collision security of Tandem-DM in the ideal cipher model
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• On the collision and preimage security of MDC-4 in the ideal cipher model
• Indifferentiability of double length compression functions
• Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
• Hash functions based on three permutations: a generic security analysis
• Stam's conjecture and threshold phenomena in collision resistance
• The preimage security of double-block-length compression functions
• Stam's collision resistance conjecture
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
• Optimal collision security in double block length hashing with single length key
• Counter-\(b\)DM: a provably secure family of multi-block-length compression functions
• Combining Compression Functions and Block Cipher-Based Hash Functions
• Fast Software Encryption

Cited In (10)

• Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
• Security of cyclic double block length hash functions
• Another glance at double-length hashing
• Indifferentiability of double length compression functions
• Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
• A note on quantum collision resistance of double-block-length compression functions
• Collision resistant double-length hashing
• Title not available (Why is that?)
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• Optimal collision security in double block length hashing with single length key

This page was built for publication: Optimal collision security in double block length hashing with single length key

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522211)