Increasing the flexibility of the herding attack
type: Item
instance of: scholarly article
title: Increasing the flexibility of the herding attack
zbMATH Open document ID: 1233.94020
author: Bart Mennink
published in: Information Processing Letters
publication date: 2012-03-09T00:00:00Z
full work available at URL: article-2081.pdf
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6013695
zbMATH Keywords: cryptography
zbMATH Keywords: hash functions
zbMATH Keywords: chosen-target-forced-prefix
zbMATH Keywords: generalized herding attack
zbMATH Keywords: hypergraphs
MaRDI profile type: Publication
OpenAlex ID: W1998191293
cites work: Threshold Functions for H-factors
cites work: Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård
cites work: Second Preimage Attacks on Dithered Hash Functions
cites work: Provable Chosen-Target-Forced-Midfix Preimage Resistance
cites work: Seven-Property-Preserving Iterated Hashing: ROX
cites work: On the complexity of the herding attack and some related attacks on hash functions
cites work: Perfect Matchings in Random r-regular, s-uniform Hypergraphs
cites work: Merkle-Damgård Revisited: How to Construct a Hash Function
cites work: Q3212279
cites work: Q3286850
cites work: On the existence of a factor of degree one of a connected random graph
cites work: Perfect matchings in random s‐uniform hypergraphs
cites work: Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
cites work: Q4519896
cites work: Factors in random graphs
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Herding Hash Functions and the Nostradamus Attack
cites work: Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
cites work: Perfect matchings in random uniform hypergraphs
cites work: Triangle Factors in Random Graphs
cites work: One Way Hash Functions and DES
cites work: Hash function requirements for Schnorr signatures
cites work: Matching and covering the vertices of a random graph by copies of a given graph
cites work: A threshold for perfect matchings in random d-pure hypergraphs
cites work: \(H(n)\)-factors in random graphs
DOI: 10.1016/J.IPL.2011.10.014
description: scientific article; zbMATH DE number 6013695