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

DOI10.1007/S10623-016-0227-2MaRDI QIDQ522211zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

indifferentiabilitycompression functioncollision resistancebeyond birthday bounddouble block lengthpreimage resistance

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

Cited in

(10)

• scientific article; zbMATH DE number 5901454 (Why is no real title available?)
• Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
• Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
• Indifferentiability of double length compression functions
• Collision resistant double-length hashing
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• 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
• A note on quantum collision resistance of double-block-length compression functions

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)