Average-case analysis of algorithms for matchings and related problems
Journal of the ACM (JACM)
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Abelian Squares are Avoidable on 4 Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Automatic Sequences: Theory, Applications, Generalizations
Automatic Sequences: Theory, Applications, Generalizations
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
ACM Transactions on Information and System Security (TISSEC)
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Graph Theory
Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård
Selected Areas in Cryptography
A composition theorem for universal one-way hash functions
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Second preimage attacks on dithered hash functions
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Second preimages on n-bit hash functions for much less than 2n work
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Herding hash functions and the nostradamus attack
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Increasing the flexibility of the herding attack
Information Processing Letters
Provable chosen-target-forced-midfix preimage resistance
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
| Hi-index | 0.00 |
In this article, we analyze the complexity of the construction of the 2 k -diamond structure proposed by Kelsey and Kohno (LNCS, Vol 4004, pp 183---200, 2006). We point out a flaw in their analysis and show that their construction may not produce the desired diamond structure. We then give a more rigorous and detailed complexity analysis of the construction of a diamond structure. For this, we appeal to random graph theory (in particular, to the theory of random intersection graphs), which allows us to determine sharp necessary and sufficient conditions for the message complexity (i.e., the number of hash computations required to build the required structure). We also analyze the computational complexity for constructing a diamond structure, which has not been previously studied in the literature. Finally, we study the impact of our analysis on herding and other attacks that use the diamond structure as a subroutine. Precisely, our results shows the following: 1. The message complexity for the construction of a diamond structure is $${\sqrt{k}}$$ times more than the amount previously stated in literature. 2. CDATA[The time complexity is n times the message complexity, where n is the size of hash value. Due to the above two results, the herding attack (Kelsey and Kohno, LNCS, Vol 4004, pp 183---200, 2006) and the second preimage attack (Andreeva et al., LNCS, Vol 4965, pp 270---288, 2008) on iterated hash functions have increased complexity. We also show that the message complexity of herding and second preimage attacks on "hash twice" is n times the complexity claimed by Andreeva et al. (LNCS, Vol 5867, pp 393---414, 2009), by giving a more detailed analysis of the attack.