On the complexity of the herding attack and some related attacks on hash functions
DOI10.1007/S10623-010-9481-XzbMATH Open1241.05131OpenAlexW2033154378MaRDI QIDQ420639FDOQ420639
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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Random graphs.
- Automatic Sequences
- Herding Hash Functions and the Nostradamus Attack
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Second Preimage Attacks on Dithered Hash Functions
- Title not available (Why is that?)
- Average-case analysis of algorithms for matchings and related problems
- Connectivity of the uniform random intersection graph
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Component evolution in a secure wireless sensor network
- A composition theorem for universal one-way hash functions
- On the existence of a factor of degree one of a connected random graph
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
- Introduction to modern cryptography
- Hash function requirements for Schnorr signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Quantum attacks on hash constructions with low quantum random access memory
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- 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)
