Increasing the flexibility of the herding attack
From MaRDI portal
Publication:763502
DOI10.1016/J.IPL.2011.10.014zbMATH Open1233.94020OpenAlexW1998191293MaRDI QIDQ763502FDOQ763502
Authors: Bart Mennink 
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-2081.pdf
Recommendations
- Herding Hash Functions and the Nostradamus Attack
- Provable chosen-target-forced-midfix preimage resistance
- On chosen target forced prefix preimage resistance
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factors in random graphs
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Herding Hash Functions and the Nostradamus Attack
- Perfect matchings in random uniform hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- 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
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- On the complexity of the herding attack and some related attacks on hash functions
- One Way Hash Functions and DES
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Provable chosen-target-forced-midfix preimage resistance
- Seven-Property-Preserving Iterated Hashing: ROX
- 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
- Hash function requirements for Schnorr signatures
- Triangle Factors in Random Graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- Threshold Functions for H-factors
- A threshold for perfect matchings in random d-pure hypergraphs
- \(H(n)\)-factors in random graphs
Cited In (4)
This page was built for publication: Increasing the flexibility of the herding attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763502)
