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

DOI10.1007/s10623-016-0227-2zbMath1381.94082OpenAlexW2413819851MaRDI QIDQ522211

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

zbMATH Keywords

compression functionindifferentiabilitycollision resistancebeyond birthday bounddouble block lengthpreimage resistance

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• MJH: a faster alternative to MDC-2
• 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
• Careful with Composition: Limitations of the Indifferentiability Framework
• MJH: A Faster Alternative to MDC-2
• The Preimage Security of Double-Block-Length Compression Functions
• Blockcipher-Based Hashing Revisited
• Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation
• Stam’s Collision Resistance Conjecture
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Security of Cyclic Double Block Length Hash Functions
• Another Glance at Double-Length Hashing
• Optimal Collision Security in Double Block Length Hashing with Single Length Key
• Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions
• The Collision Security of Tandem-DM in the Ideal Cipher Model
• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• Seven-Property-Preserving Iterated Hashing: ROX
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• Towards Optimal Double-Length Hash Functions
• Merkle-Damgård Revisited: How to Construct a Hash Function
• A Failure-Friendly Design Principle for Hash Functions
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• Combining Compression Functions and Block Cipher-Based Hash Functions
• Fast Software Encryption
• Fast Software Encryption
• Theory of Cryptography

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