{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:45:28Z","timestamp":1777376728486,"version":"3.51.4"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206853","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"477-482","source":"Crossref","is-referenced-by-count":3,"title":["Differential cryptanalysis of Mod-2\/Mod-3 constructions of binary weak PRFs"],"prefix":"10.1109","author":[{"given":"Thomas","family":"Johansson","sequence":"first","affiliation":[{"name":"Lund University"}]},{"given":"Willi","family":"Meier","sequence":"additional","affiliation":[{"name":"University of Applied Sciences and Arts,Northwestern Switzerland"}]},{"given":"Vu","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Lund University"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_29"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_18"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_18"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_27"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_29"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_22"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_9"},{"key":"ref1","first-page":"464","article-title":"How to construct random functions (extended abstract)","author":"goldreich","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01071-x"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45611-8_1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97121-2_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-79063-3_2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_17"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref22","first-page":"20:1","article-title":"A faster algorithm for finding closest pairs in hamming metric","volume":"213","author":"esser","year":"2021","journal-title":"41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science FSTTCS 2021 December 15-17 2021 Virtual Conference"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2050814"},{"key":"ref8","first-page":"563","article-title":"Weak is better: Tightly secure short signatures from weak prfs","author":"alperin-sheriff","year":"2017","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_8"},{"key":"ref9","first-page":"86:1","article-title":"On the complexity of decomposable randomized encodings, or: How friendly can a garbling-friendly PRF be?","volume":"151","author":"ball","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9185-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8_3"},{"key":"ref5","first-page":"1","article-title":"Keying hash functions for message authentication","volume":"1109","author":"bellare","year":"0"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206853.pdf?arnumber=10206853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:51Z","timestamp":1773347271000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206853\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206853","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}