{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:50:10Z","timestamp":1767970210069,"version":"3.49.0"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1109\/tit.2022.3171178","type":"journal-article","created":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T20:01:04Z","timestamp":1651262464000},"page":"6218-6232","source":"Crossref","is-referenced-by-count":15,"title":["Proof of Mirror Theory for <i>\u03be<\/i>\n                  <sub>max<\/sub> = 2"],"prefix":"10.1109","volume":"68","author":[{"given":"Avijit","family":"Dutta","sequence":"first","affiliation":[{"name":"Institute for Advancing Intelligence, TCG-CREST, Kolkata, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-6576","authenticated-orcid":false,"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]},{"given":"Abishanka","family":"Saha","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_34"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11925-5_25"},{"key":"ref33","first-page":"232","article-title":"A proof of security in O(2n) for the Xor of two random permutations","author":"patarin","year":"2008","journal-title":"Proc 3rd Int Conf Inf Theoretic Secur (ICITS)"},{"key":"ref32","first-page":"328","article-title":"The &#x2018;coefficients H&#x2019; technique","author":"patarin","year":"2008","journal-title":"Proc Sel Areas Cryptogr 15th Int Workshop (SAC)"},{"key":"ref31","first-page":"328","article-title":"The &#x2018;coefficients H&#x2019; technique","author":"patarin","year":"2008","journal-title":"Select Areas Cryptogr"},{"key":"ref30","first-page":"299","article-title":"On linear systems of equations with distinct variables and small block size","author":"patarin","year":"2005","journal-title":"Proc Inf Secur Cryptol 8th Int Conf (ICISC)"},{"key":"ref37","first-page":"332","article-title":"Sequences of games: A tool for taming complexity in security proofs","volume":"2004","author":"shoup","year":"2004","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_23"},{"key":"ref35","first-page":"368","article-title":"Security in O(2n) for the Xor of two random permutations-proof with the standard H technique","author":"patarin","year":"2013","journal-title":"Proc IACR Cryptol ePrint Arch"},{"key":"ref34","first-page":"287","article-title":"Introduction to mirror theory: Analysis of systems of linear equalities and linear non equalities for cryptography","volume":"2010","author":"patarin","year":"2010","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_17"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34961-4_19"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2018.i3.36-92"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2017.i4.268-305"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_21"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2019042"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11799313_20"},{"key":"ref17","first-page":"1087","article-title":"CENC is optimally secure","volume":"2016","author":"iwata","year":"2016","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2016.i1.134-157"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_25"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70700-6_16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054132"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26059-4_9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_25"},{"key":"ref5","article-title":"CENCPP*-beyond-birthday-secure encryption from public permutations","author":"bhattacharjee","year":"2020"},{"key":"ref29","first-page":"513","article-title":"Luby-Rackoff: 7 rounds are enough for 2n(1&#x2013;?)security","author":"patarin","year":"2003","journal-title":"Proc Adv Cryptol 23rd Annu Int Cryptol Conf (CRYPTO)"},{"key":"ref8","first-page":"285","article-title":"The indistinguishability of the XOR of k permutations","author":"cogliati","year":"2014","journal-title":"Proc 20th Int Workshop Fast Softw Encryption (FSE)"},{"key":"ref7","first-page":"78","article-title":"A short proof of the PRP\/PRF switching lemma","volume":"2008","author":"chang","year":"2020","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1694"},{"key":"ref1","first-page":"24","article-title":"A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion","volume":"1999","author":"bellare","year":"1999","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref9","first-page":"734","article-title":"Mirror theory: A simple proof of the Pi?Pj theorem with ?_max=2","volume":"2020","author":"cogliati","year":"2020","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52153-4_15"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_34"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2017.i4.306-325"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_19"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/9715947"},{"key":"ref23","first-page":"343","article-title":"The security and performance of the galois\/counter mode (GCM) of operation","author":"david mcgrew","year":"2004","journal-title":"Proc 5th Int Conf Cryptol (INDOCRYPT)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49530-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21568-2_7"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9861208\/09765795.pdf?arnumber=9765795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:15:48Z","timestamp":1662408948000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9765795\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3171178","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}