Increasing the flexibility of the herding attack
From MaRDI portal
Publication:763502
DOI10.1016/j.ipl.2011.10.014zbMath1233.94020OpenAlexW1998191293MaRDI QIDQ763502
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
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of the herding attack and some related attacks on hash functions
- \(H(n)\)-factors in random graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- A threshold for perfect matchings in random d-pure hypergraphs
- Provable Chosen-Target-Forced-Midfix Preimage Resistance
- Factors in random graphs
- Herding Hash Functions and the Nostradamus Attack
- Hash function requirements for Schnorr signatures
- Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård
- Threshold Functions for H-factors
- Triangle Factors in Random Graphs
- Perfect matchings in random uniform hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- Perfect Matchings in Random r-regular, s-uniform Hypergraphs
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Seven-Property-Preserving Iterated Hashing: ROX
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Second Preimage Attacks on Dithered Hash Functions
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- On the existence of a factor of degree one of a connected random graph
- One Way Hash Functions and DES
