On the complexity of the herding attack and some related attacks on hash functions

DOI10.1007/S10623-010-9481-XMaRDI QIDQ420639zbMATH OpenOpenAlexFDO

Authors Simon R. Blackburn, D. R. Stinson, Jalaj Upadhyay

Publication date 22 May 2012

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

Full work available at URL https://doi.org/10.1007/s10623-010-9481-x

zbMATH Keywords

hash functionherding attackdiamond structure

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On diamond structures and Trojan message attacks
• Efficient construction of diamond structures
• Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
• Increasing the flexibility of the herding attack
• Herding Hash Functions and the Nostradamus Attack

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 2051154 (Why is no real title available?)
• scientific article; zbMATH DE number 822581 (Why is no real title available?)
• scientific article; zbMATH DE number 2221909 (Why is no real title available?)
• A composition theorem for universal one-way hash functions
• Advances in Cryptology – CRYPTO 2004
• Automatic Sequences
• Average-case analysis of algorithms for matchings and related problems
• Component evolution in a secure wireless sensor network
• Connectivity of the uniform random intersection graph
• Graph theory
• Hash function requirements for Schnorr signatures
• Herding Hash Functions and the Nostradamus Attack
• Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
• Introduction to modern cryptography
• On the existence of a factor of degree one of a connected random graph
• Random graphs.
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Second Preimage Attacks on Dithered Hash Functions
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Sharp threshold functions for random intersection graphs via a coupling method

Cited in

(10)

• Nostradamus goes quantum
• On Some Combinatorial Properties of Random Intersection Graphs
• Efficient construction of diamond structures
• Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
• Quantum attacks on hash constructions with low quantum random access memory
• Increasing the flexibility of the herding attack
• Improving generic attacks using exceptional functions
• On diamond structures and Trojan message attacks
• Provable chosen-target-forced-midfix preimage resistance
• Generic attacks on hash combiners

This page was built for publication: On the complexity of the herding attack and some related attacks on hash functions

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