{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:09:38Z","timestamp":1765112978850,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T00:00:00Z","timestamp":1656115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T00:00:00Z","timestamp":1656115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"institute of information & communications technology planning & evaluation(iitp) grant funded by the korea government (msi","award":["2016-6-00598","2016-6-00598"],"award-info":[{"award-number":["2016-6-00598","2016-6-00598"]}]},{"name":"s, korea institute for advanced study, seoul 02455, korea.supported by national research foundation of korea (nrf) grants funded by the ko-rean government (msip","award":["NRF-2012R1A2A2A01018585 & 2017R1E1A1A03070"],"award-info":[{"award-number":["NRF-2012R1A2A2A01018585 & 2017R1E1A1A03070"]}]},{"name":"kias individual grant","award":["CG046001"],"award-info":[{"award-number":["CG046001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10623-022-01071-x","type":"journal-article","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T12:02:51Z","timestamp":1656158571000},"page":"1735-1760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions"],"prefix":"10.1007","volume":"90","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1769-8751","authenticated-orcid":false,"given":"Wonhee","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Jeong Han","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Jiseung","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,25]]},"reference":[{"key":"1071_CR1","unstructured":"Akavia A., Bogdanov A., Guo S., Kamath A., Rosen A.: Candidate weak pseudorandom functions in ac0$$\\bigcirc $$ mod2. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 251\u2013260 (2014)."},{"key":"1071_CR2","unstructured":"Alperin-Sheriff J., Apon D.: Weak is better: tightly secure short signatures from weak prfs. IACR Cryptol. ePrint Arch. (2017)."},{"key":"1071_CR3","doi-asserted-by":"crossref","unstructured":"Ananth P., Brakerski Z., Segev G., Vaikuntanathan V.: From selective to adaptive security in functional encryption. In: Annual Cryptology Conference, pp. 657\u2013677. Springer (2015).","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"1071_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum B.: Bootstrapping obfuscators via fast pseudorandom functions. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 162\u2013172. Springer (2014).","DOI":"10.1007\/978-3-662-45608-8_9"},{"key":"1071_CR5","unstructured":"Ball M., Holmgren J., Ishai Y., Liu T., Malkin T.: On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly prf be? In: 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2020)."},{"issue":"4","key":"1071_CR6","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1007\/s00145-014-9185-x","volume":"28","author":"M Bellare","year":"2015","unstructured":"Bellare M.: New proofs for nmac and hmac: security without collision resistance. J. Cryptol. 28(4), 844\u2013878 (2015).","journal-title":"J. Cryptol."},{"key":"1071_CR7","doi-asserted-by":"crossref","unstructured":"Bellare M., Canetti R., Krawczyk H.: Keying hash functions for message authentication. In: Annual International Cryptology Conference, pp. 1\u201315. Springer (1996).","DOI":"10.1007\/3-540-68697-5_1"},{"key":"1071_CR8","unstructured":"Bernstein D.J.: Better price-performance ratios for generalized birthday attacks. (2007)."},{"key":"1071_CR9","first-page":"292","volume":"2009","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein D.J., Lange T., Niederhagen R., Peters C., Schwabe P.: Implementing wagner\u2019s generalized birthday attack against the SHA-3 round-1 candidate FSB. IACR Cryptol. ePrint Arch. 2009, 292 (2009).","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"4","key":"1071_CR10","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A Blum","year":"2003","unstructured":"Blum A., Kalai A., Wasserman H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM (JACM) 50(4), 506\u2013519 (2003).","journal-title":"J. ACM (JACM)"},{"key":"1071_CR11","doi-asserted-by":"crossref","unstructured":"Bogdanov A., Rosen A.: Pseudorandom functions: three decades later. In: Tutorials on the Foundations of Cryptography, pp. 79\u2013158. Springer (2017).","DOI":"10.1007\/978-3-319-57048-8_3"},{"issue":"3","key":"1071_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12095-015-0149-2","volume":"8","author":"S Bogos","year":"2016","unstructured":"Bogos S., Tramer F., Vaudenay S.: On solving lpn using bkw and variants. Cryptogr. Commun. 8(3), 331\u2013369 (2016).","journal-title":"Cryptogr. Commun."},{"key":"1071_CR13","doi-asserted-by":"crossref","unstructured":"Boneh D., Ishai Y., Passel\u00e8gue A., Sahai A., Wu D.J.: Exploring crypto dark matter. In: Theory of Cryptography Conference, pp. 699\u2013729. Springer (2018).","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"1071_CR14","doi-asserted-by":"crossref","unstructured":"Chen Y., Hhan M., Vaikuntanathan V., Wee H.: Matrix prfs: Constructions, attacks, and applications to obfuscation. In: Theory of Cryptography Conference, pp. 55\u201380. Springer (2019).","DOI":"10.1007\/978-3-030-36030-6_3"},{"key":"1071_CR15","doi-asserted-by":"crossref","unstructured":"Chen Y., Vaikuntanathan V., Wee H.: GGH15 beyond permutation branching programs: proofs, attacks, and candidates. In: CRYPTO 2018, Part II, pp. 577\u2013607 (2018).","DOI":"10.1007\/978-3-319-96881-0_20"},{"key":"1071_CR16","first-page":"739","volume":"2","author":"JH Cheon","year":"2021","unstructured":"Cheon J.H., Cho W., Kim J.H., Kim J.: Adventures in crypto dark matter: Attacks and fixes for weak pseudorandom functions. In Public Key Cryptography 2, 739\u2013760 (2021).","journal-title":"In Public Key Cryptography"},{"key":"1071_CR17","doi-asserted-by":"crossref","unstructured":"Damg\u00e5ard I., Nielsen J.B.: Expanding pseudorandom functions; or: From known-plaintext security to chosen-plaintext security. In: Annual International Cryptology Conference, pp. 449\u2013464. Springer (2002).","DOI":"10.1007\/3-540-45708-9_29"},{"issue":"8","key":"1071_CR18","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1007\/s10623-018-00594-6","volume":"87","author":"I Dinur","year":"2019","unstructured":"Dinur I.: An algorithmic framework for the generalized birthday problem. Des. Codes Cryptogr. 87(8), 1897\u20131926 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1071_CR19","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1007\/s00145-018-9303-2","volume":"32","author":"I Dinur","year":"2019","unstructured":"Dinur I., Dunkelman O., Keller N., Shamir A.: Efficient dissection of bicomposite problems with cryptanalytic applications. J. Cryptol. 32(4), 1448\u20131490 (2019).","journal-title":"J. Cryptol."},{"key":"1071_CR20","doi-asserted-by":"crossref","unstructured":"Dinur I., Goldfeder S., Halevi T., Ishai Y., Kelkar M., Sharma V., Zaverucha G.: Mpc-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. Cryptol. ePrint Arch., Report 2021\/885 (2021). To appear CRYPTO 2021.","DOI":"10.1007\/978-3-030-84259-8_18"},{"key":"1071_CR21","doi-asserted-by":"crossref","unstructured":"Dodis Y., Kiltz E., Pietrzak K., Wichs D.: Message authentication, revisited. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 355\u2013374. Springer (2012).","DOI":"10.1007\/978-3-642-29011-4_22"},{"key":"1071_CR22","doi-asserted-by":"crossref","unstructured":"Dodis Y., Steinberger J.: Message authentication codes from unpredictable block ciphers. In: Annual International Cryptology Conference, pp. 267\u2013285. Springer (2009).","DOI":"10.1007\/978-3-642-03356-8_16"},{"key":"1071_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich O.: Two remarks concerning the goldwasser-micali-rivest signature scheme. In: Conference on the Theory and Application of Cryptographic Techniques, pp. 104\u2013110. Springer (1986).","DOI":"10.1007\/3-540-47721-7_8"},{"issue":"4","key":"1071_CR24","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich O., Goldwasser S., Micali S.: How to construct random functions. J. ACM (JACM) 33(4), 792\u2013807 (1986).","journal-title":"J. ACM (JACM)"},{"key":"1071_CR25","doi-asserted-by":"crossref","unstructured":"Lyubashevsky V., Masny D.: Man-in-the-middle secure authentication schemes from lpn and weak prfs. In: Annual Cryptology Conference, pp. 308\u2013325. Springer (2013).","DOI":"10.1007\/978-3-642-40084-1_18"},{"key":"1071_CR26","doi-asserted-by":"crossref","unstructured":"Maurer U., Sj\u00f6din J.: A fast and key-efficient reduction of chosen-ciphertext to known-plaintext security. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 498\u2013516. Springer (2007).","DOI":"10.1007\/978-3-540-72540-4_29"},{"key":"1071_CR27","doi-asserted-by":"crossref","unstructured":"Micciancio D., Walter M.: On the bit security of cryptographic primitives. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 3\u201328. Springer (2018).","DOI":"10.1007\/978-3-319-78381-9_1"},{"key":"1071_CR28","doi-asserted-by":"crossref","unstructured":"Naya-Plasencia M., Schrottenloher A.: Optimal merging in quantum k-xor and k-xor-sum algorithms. In: Advances in Cryptology \u2013 EUROCRYPT 2020, pp. 311-340. Springer, Cham (2020).","DOI":"10.1007\/978-3-030-45724-2_11"},{"key":"1071_CR29","doi-asserted-by":"crossref","unstructured":"Nikoli\u0107 I., Sasaki Y.: Refinements of the k-tree algorithm for the generalized birthday problem. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 683\u2013703. Springer (2015).","DOI":"10.1007\/978-3-662-48800-3_28"},{"key":"1071_CR30","doi-asserted-by":"crossref","unstructured":"Pietrzak K.: A leakage-resilient mode of operation. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 462\u2013482. Springer (2009).","DOI":"10.1007\/978-3-642-01001-9_27"},{"key":"1071_CR31","first-page":"407","volume":"2021","author":"A Schrottenloher","year":"2021","unstructured":"Schrottenloher A.: Improved quantum algorithms for the k-xor problem. IACR Cryptol. ePrint Arch. 2021, 407 (2021).","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"1071_CR32","doi-asserted-by":"crossref","unstructured":"Wagner D.: A generalized birthday problem. In: Annual International Cryptology Conference, pp. 288\u2013304. Springer (2002).","DOI":"10.1007\/3-540-45708-9_19"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01071-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T19:28:56Z","timestamp":1659209336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01071-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,25]]},"references-count":32,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1071"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01071-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,6,25]]},"assertion":[{"value":"27 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}