{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:01:08Z","timestamp":1777964468640,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T00:00:00Z","timestamp":1297728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10623-010-9481-x","type":"journal-article","created":{"date-parts":[[2011,2,14]],"date-time":"2011-02-14T05:18:22Z","timestamp":1297660702000},"page":"171-193","source":"Crossref","is-referenced-by-count":27,"title":["On the complexity of the herding attack and some related attacks on hash functions"],"prefix":"10.1007","volume":"64","author":[{"given":"Simon R.","family":"Blackburn","sequence":"first","affiliation":[]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[]},{"given":"Jalaj","family":"Upadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,15]]},"reference":[{"key":"9481_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.P. Allouche","year":"2003","unstructured":"Allouche J.P., Shallit J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"9481_CR2","unstructured":"Andreeva E., Bouillaguet C., Fouque P.A., Hoch J.J., Kelsey J., Shamir A., Zimmer S.: Second preimage attacks on dithered hash functions. In: EUROCRYPT, Lecture Notes in Computer Science, vol. 4965, pp. 270\u2013288 (2008)."},{"key":"9481_CR3","unstructured":"Andreeva E., Bouillaguet C., Dunkelman O., Kelsey J.: Herding, second preimage and Trojan message attacks beyond Merkle-Damg\u00e5rd. In: Selected Areas in Cryptography, Lecture Notes in Computer Science, vol. 5867, pp. 393\u2013414 (2009)."},{"issue":"16","key":"9481_CR4","doi-asserted-by":"crossref","first-page":"5130","DOI":"10.1016\/j.disc.2009.03.042","volume":"309","author":"S.R. Blackburn","year":"2009","unstructured":"Blackburn S.R., Gerke S.: Connectivity of the uniform random intersection graph. Discret. Math. 309(16), 5130\u20135140 (2009)","journal-title":"Discret. Math."},{"issue":"1","key":"9481_CR5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.20256","volume":"53","author":"M. Bloznelis","year":"2009","unstructured":"Bloznelis M., Jaworski J., Rybarczyk K: Component evolution in a secure wireless sensor network. Networks 53(1), 19\u201326 (2009)","journal-title":"Networks"},{"key":"9481_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"key":"9481_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"9481_CR8","unstructured":"Erd\u00f6s P., Renyi A.: On the evolution of random graphs. In: Proceedings of the Hungarian Academy of Sciences, vol. 5, pp. 17\u201361 (1960)."},{"issue":"3\u20134","key":"9481_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01894879","volume":"17","author":"P. Erd\u00f6s","year":"1966","unstructured":"Erd\u00f6s P., R\u00e9nyi A.: On the existence of a factor of degree one of a connected random graph. Acta Mathematica Academiae Scientiarum Hungaricae Tomus 17(3\u20134), 359\u2013368 (1966)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae Tomus"},{"key":"9481_CR10","doi-asserted-by":"crossref","unstructured":"Eschenauer L., Gligor V.: A key-management scheme for distributed sensor networks. In: Proc. 9th ACM conference on Computer and Communications Security, pp. 41\u201347 (2002).","DOI":"10.1145\/586115.586117"},{"issue":"2","key":"9481_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1002\/(SICI)1098-2418(200003)16:2<156::AID-RSA3>3.0.CO;2-H","volume":"16","author":"J.A. Fill","year":"2000","unstructured":"Fill J.A., Scheinerman E.R., Singer-Cohen K.B.: Random intersection graphs when m\u00a0=\u00a0\u03a9(n): An equivalence theorem relating the evolution of the g(n, m, p) and g(n, p) models. Random Struct. Algorithms 16(2), 156\u2013176 (2000)","journal-title":"Random Struct. Algorithms"},{"key":"9481_CR12","first-page":"67","volume-title":"Studies in Classification, Data Analysis and Knowledge Organization, vol. 22","author":"E. Godehardt","year":"2003","unstructured":"Godehardt E., Jaworski J.: Two models of random intersection graphs for classification. In: Optiz, O., Schwaiger, M. (eds) Studies in Classification, Data Analysis and Knowledge Organization, vol. 22, pp. 67\u201382. Springer, Berlin (2003)"},{"key":"9481_CR13","doi-asserted-by":"crossref","unstructured":"Joux A.: Multicollisions in iterated hash functions. Application to cascaded constructions. In: CRYPTO, Lecture Notes in Computer Science, vol. 3152, pp. 306\u2013316 (2004).","DOI":"10.1007\/978-3-540-28628-8_19"},{"key":"9481_CR14","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J. Katz","year":"2007","unstructured":"Katz J., Lindell Y.: Introduction to Modern Cryptography. Chapman and Hall, CRC Press, Boca Raton (2007)"},{"key":"9481_CR15","unstructured":"Kelsey J., Kohno T.: Herding hash functions and the Nostradamus attack. In: EUROCRYPT, Lecture Notes in Computer Science, vol. 4004, pp. 183\u2013200 (2006)."},{"key":"9481_CR16","unstructured":"Kelsey J., Schneier B.: Second preimages on n-bit hash functions for much less than 2 n work. In: EUROCRYPT, Lecture Notes in Computer Science, vol. 3494, pp. 474\u2013490 (2005)."},{"key":"9481_CR17","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen V.: Abelian squares are avoidable on 4 letters. In: ICALP, pp. 41\u201352 (1992).","DOI":"10.1007\/3-540-55719-9_62"},{"key":"9481_CR18","unstructured":"Ker\u00e4nen V.: On abeliean square-free DT0L-languages over 4 letters. In: Proceedings of Conference on Combinatorics on Words, pp. 41\u201352 (2003)."},{"key":"9481_CR19","doi-asserted-by":"crossref","unstructured":"Micali S., Vazirani V.V.: An $${{\\rm O}(m\\sqrt{n})}$$ algorithm for finding maximum matching in general graphs. In: FOCS, pp. 17\u201327 (1980).","DOI":"10.1109\/SFCS.1980.12"},{"key":"9481_CR20","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1145\/195613.195663","volume":"6","author":"R. Motwani","year":"1994","unstructured":"Motwani R.: Average-case analysis of algorithms for matchings and related problems. J. ACM 6, 1329\u20131356 (1994)","journal-title":"J. ACM"},{"key":"9481_CR21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1515\/JMC.2009.004","volume":"3","author":"G. Neven","year":"2009","unstructured":"Neven G., Smart N., Warinschi B.: Hash function requirements for Schnorr signatures. J. Math. Cryptol. 3, 69\u201387 (2009)","journal-title":"J. Math. Cryptol."},{"key":"9481_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1341731.1341734","volume":"11","author":"R.D. Pietro","year":"2008","unstructured":"Pietro R.D., Mancini L., Mei A., Panconesi A., Radhakrishnan J.: Redoubtable sensor networks. ACM Trans. Inform. Systems Security 11, 1\u201322 (2008)","journal-title":"ACM Trans. Inform. Systems Security"},{"key":"9481_CR23","unstructured":"Rivest R.: Abelian square-free dithering for iterated hash functions (2005)."},{"key":"9481_CR24","unstructured":"Rybarczyk K.: Sharp threshold functions for the random intersection graph via coupling method. http:\/\/arxiv.org\/abs\/0910.0749 , Nov (2009)."},{"key":"9481_CR25","unstructured":"Shoup V.: A composition theorem for universal one-way hash functions. In: EUROCRYPT, Lecture Notes in Computer Science, vol. 1807, pp. 445\u2013452, (2000)."},{"key":"9481_CR26","unstructured":"Stallings W.: Cryptography and Network Security. PhD thesis, Johns Hopkins University, Baltimore, Maryland (1995)."},{"key":"9481_CR27","volume-title":"Random intersection graphs","author":"K.B. Singer-Cohen","year":"2006","unstructured":"Singer-Cohen K.B.: Random intersection graphs. Prentice Hall, New York (2006)"},{"key":"9481_CR28","volume-title":"Cryptography: Theory and Practice","author":"D. Stinson","year":"2006","unstructured":"Stinson D.: Cryptography: Theory and Practice. Chapman & Hall\/CRC Press Inc., Boca Raton (2006)"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9481-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9481-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9481-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T14:39:12Z","timestamp":1560004752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9481-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,15]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["9481"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9481-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,15]]}}}