Increasing the flexibility of the herding attack

DOI10.1016/J.IPL.2011.10.014MaRDI QIDQ763502zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

cryptographyhypergraphshash functionschosen-target-forced-prefixgeneralized herding attack

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

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

Cites work

• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• A threshold for perfect matchings in random d-pure hypergraphs
• Advances in Cryptology – CRYPTO 2004
• Factors in random graphs
• Hash function requirements for Schnorr signatures
• Herding Hash Functions and the Nostradamus Attack
• Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
• Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
• Matching and covering the vertices of a random graph by copies of a given graph
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the complexity of the herding attack and some related attacks on hash functions
• On the existence of a factor of degree one of a connected random graph
• One Way Hash Functions and DES
• Perfect Matchings in Random r-regular, s-uniform Hypergraphs
• Perfect matchings in random s‐uniform hypergraphs
• Perfect matchings in random uniform hypergraphs
• Provable chosen-target-forced-midfix preimage resistance
• Second Preimage Attacks on Dithered Hash Functions
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• Seven-Property-Preserving Iterated Hashing: ROX
• Threshold Functions for H-factors
• Triangle Factors in Random Graphs
• \(H(n)\)-factors in random graphs

Cited in

(4)

• Herding Hash Functions and the Nostradamus Attack
• Provable chosen-target-forced-midfix preimage resistance
• On the complexity of the herding attack and some related attacks on hash functions
• On chosen target forced prefix preimage resistance

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)