A Failure-Friendly Design Principle for Hash Functions

DOI10.1007/11593447_26zbMATH Open1154.94414OpenAlexW1754628477MaRDI QIDQ5451086FDOQ5451086

Authors: Stefan Lucks 

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11593447_26

Recommendations

• Merkle-Damgård Revisited: How to Construct a Hash Function
• scientific article; zbMATH DE number 7647212
• scientific article
• Open problems in hash function security
• Improved Indifferentiability Security Analysis of chopMD Hash Function

zbMATH Keywords

hash functionprovable securitymulti-collisionfailure-friendliness

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (36)

• One-key compression function based MAC with security beyond birthday bound
• How to Fill Up Merkle-Damgård Hash Functions
• Simple hash function using discrete-time quantum walks
• On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
• Extended Multi-Property-Preserving and ECM-Construction
• A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
• Title not available (Why is that?)
• A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
• Hash functions from defective ideal ciphers
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Slide Attacks on a Class of Hash Functions
• The Hash Function Family LAKE
• Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
• Boomerang Distinguisher for the SIMD-512 Compression Function
• Hash function based on quantum walks
• Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
• Building indifferentiable compression functions from the PGV compression functions
• How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
• Collisions for Round-Reduced LAKE
• Collisions for RC4-Hash
• Cryptanalysis of MDC-2
• A simple variant of the Merkle-Damgård scheme with a permutation
• New second-preimage attacks on hash functions
• Fast correlation attack on stream cipher ABC v3
• Security analysis of randomize-hash-then-sign digital signatures
• A synthetic indifferentiability analysis of some block-cipher-based hash functions
• Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
• Boosting Merkle-Damgård Hashing for Message Authentication
• Expedient Non-malleability Notions for Hash Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Analysis of the Hash Function Design Strategy Called SMASH
• Hash function requirements for Schnorr signatures
• Multilane HMAC— Security beyond the Birthday Limit
• On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
• A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
• Optimal collision security in double block length hashing with single length key

This page was built for publication: A Failure-Friendly Design Principle for Hash Functions

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