{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:54:25Z","timestamp":1778064865836,"version":"3.51.4"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/tit.2017.2679757","type":"journal-article","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T19:32:02Z","timestamp":1489001522000},"page":"4050-4054","source":"Crossref","is-referenced-by-count":14,"title":["Indifferentiability of the Sum of Random Permutations Toward Optimal Security"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5471-9350","authenticated-orcid":false,"given":"Jooyoung","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"285","article-title":"The indistinguishability of the XOR of k permutations","author":"cogliati","year":"2014","journal-title":"Fast Software Encryption Third International Workshop Proceedings"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28166-7_30"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85093-9_22"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17401-8_6"},{"key":"ref7","article-title":"Introduction to mirror theory: Analysis of systems of linear equalities and linear non equalities for cryptography","author":"patarin","year":"2010","journal-title":"Proc IACR Cryptology"},{"key":"ref2","article-title":"A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP->PRF conversion (1999)","author":"bellare","year":"1999","journal-title":"Proc IACR Cryptology"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054132"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7931776\/07874114.pdf?arnumber=7874114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:17Z","timestamp":1642004117000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7874114\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":11,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2679757","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}