{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:07Z","timestamp":1772283487535,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,23]],"date-time":"2015-08-23T00:00:00Z","timestamp":1440288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10623-015-0129-8","type":"journal-article","created":{"date-parts":[[2015,8,22]],"date-time":"2015-08-22T04:29:40Z","timestamp":1440217780000},"page":"83-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["$${\\text {SL}}_2$$ SL 2 homomorphic hash functions: worst case to average case reduction and short collision search"],"prefix":"10.1007","volume":"81","author":[{"given":"Ciaran","family":"Mullan","sequence":"first","affiliation":[]},{"given":"Boaz","family":"Tsaban","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,23]]},"reference":[{"key":"129_CR1","unstructured":"Abdukhalikov K., Kim C.: On the security of the hashing scheme based on $${SL}_2$$ S L 2 . In: FSE \u201998. Lecture Notes in Computer Science, vol. 1372, pp. 93\u2013102. Springer, Berlin (1998)."},{"key":"129_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of lattice problems (extended abstract). In: STOC \u201996, pp. 99\u2013108. ACM, New York (1996).","DOI":"10.1145\/237814.237838"},{"key":"129_CR3","doi-asserted-by":"crossref","unstructured":"Bourgain J., Gamburd A.: Uniform expansion bounds for Cayley graphs of $${\\text{ SL }}_2(\\mathbb{F}_p)$$ SL 2 ( F p ) . Ann. Math. 167, 625\u2013642 (2008).","DOI":"10.4007\/annals.2008.167.625"},{"key":"129_CR4","doi-asserted-by":"crossref","unstructured":"Breuillard E., Gamburd A.: Strong uniform expansion in $$\\text{ SL }(2,p)$$ SL ( 2 , p ) . Geom. Funct. Anal. 20, 1201\u20131209 (2010).","DOI":"10.1007\/s00039-010-0094-3"},{"key":"129_CR5","unstructured":"Breuillard E., Green B., Guralnick R., Tao T.: Expansion in finite simple groups of Lie type. arXiv:1309.1975 ."},{"key":"129_CR6","unstructured":"Bromberg L., Shpilrain V., Vdovina A.: Navigating in the Cayley graph of $${\\text{ SL }_2}{\\mathbb{F}_p}$$ SL 2 F p and applications to hashing. arXiv:1409.4478 ."},{"key":"129_CR7","doi-asserted-by":"crossref","unstructured":"Charles D., Lauter K., Goren E.: Cryptographic hash functions from expander graphs. J. Cryptol. 22, 93\u2013113 (2009).","DOI":"10.1007\/s00145-007-9002-x"},{"key":"129_CR8","unstructured":"Faug\u00e8re J., Perret L., Petit C., Renault G.: New subexponential algorithms for factoring in $${\\text{ SL }_2} ({\\mathbb{F}}_{2^{n}})$$ SL 2 ( F 2 n ) . Cryptology ePrint Archive, Report 2011\/598."},{"key":"129_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008).","DOI":"10.1017\/CBO9780511804106"},{"key":"129_CR10","doi-asserted-by":"crossref","unstructured":"Grassl M., Ili\u0107 I., Magliveras S., Steinwandt R.: Cryptanalysis of the Tillich\u2013Z\u00e9mor hash function. J. Cryptol. 24, 148\u2013156 (2011).","DOI":"10.1007\/s00145-010-9063-0"},{"key":"129_CR11","doi-asserted-by":"crossref","unstructured":"Hoory S., Linial N., Wigderson A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43, 439\u2013561 (2006).","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"129_CR12","doi-asserted-by":"crossref","unstructured":"Lubotzky A.: Expander graphs in pure and applied mathematics. Bull. Am. Math. Soc. 49, 113\u2013162 (2012).","DOI":"10.1090\/S0273-0979-2011-01359-3"},{"key":"129_CR13","unstructured":"Naik V. (moderator): Element structure of special linear group of degree two over a finite field. Groupprops, The Group Properties Wiki. http:\/\/groupprops.subwiki.org\/wiki\/Element_structure_of_special_linear_group_of_degree_two_over_a_finite_field ."},{"key":"129_CR14","doi-asserted-by":"crossref","unstructured":"Petit C., Quisquater J.: Rubik\u2019s for cryptographers. Not. Am. Math. Soc. 61, 733\u2013739 (2013).","DOI":"10.1090\/noti1001"},{"key":"129_CR15","doi-asserted-by":"crossref","unstructured":"Petit C., Quisquater J., Tillich J., Z\u00e9mor G.: Hard and easy components of collision search in the Z\u00e9mor-Tillich hash function: new attacks and reduced variants with equivalent security. In: CT-RSA \u201909. Lecture Notes in Computer Science, vol. 5473, pp. 182\u2013194. Springer, Berlin (2009).","DOI":"10.1007\/978-3-642-00862-7_12"},{"key":"129_CR16","doi-asserted-by":"crossref","unstructured":"Petit C.: Towards factoring in $$\\text{ SL }_2{2^n}$$ SL 2 2 n . Des. Codes Cryptogr. 71, 409\u2013431 (2014).","DOI":"10.1007\/s10623-012-9743-x"},{"key":"129_CR17","doi-asserted-by":"crossref","unstructured":"Tillich J., Z\u00e9mor G.: Group-theoretic hash functions. In: Algebraic Coding, First French-Israeli Workshop. Lecture Notes in Computer Science, vol. 781, pp. 90\u2013110. Springer, Berlin (1994).","DOI":"10.1007\/3-540-57843-9_12"},{"key":"129_CR18","unstructured":"Tillich J., Z\u00e9mor G.: Hashing with $$\\text{ SL }_2$$ SL 2 . In: CRYPTO \u201994. Lecture Notes in Computer Science, vol. 839, pp. 508\u2013511. Springer, Berlin (1991)."},{"key":"129_CR19","doi-asserted-by":"crossref","unstructured":"Z\u00e9mor G.: Hash functions and graphs with large girths. In: Eurocrypt \u201991. Lecture Notes in Computer Science, vol. 547, pp. 508\u2013511. Springer, Berlin (1991).","DOI":"10.1007\/3-540-46416-6_44"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0129-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0129-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0129-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:41Z","timestamp":1559246321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0129-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,23]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0129-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,23]]}}}