{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:54:56Z","timestamp":1730278496346,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"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":[[2022,11,1]]},"DOI":"10.1109\/itw54588.2022.9965864","type":"proceedings-article","created":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T20:47:00Z","timestamp":1670446020000},"page":"238-242","source":"Crossref","is-referenced-by-count":0,"title":["Using data compression and randomisation to build an unconditionally secure short key cipher"],"prefix":"10.1109","author":[{"given":"Boris","family":"Ryabko","sequence":"first","affiliation":[{"name":"Novosibirsk State University,Federal Research Center for Information and Computational Technologies of SB RAS,Novosibirsk,Russian Federation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2962804"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3041224"},{"key":"ref12","article-title":"Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective","author":"li","year":"2021","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45961-8_37"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.782143"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64381-2_23"},{"key":"ref16","first-page":"36","article-title":"Various techniques used in connection with random digits","volume":"12","author":"von neumann","year":"1951","journal-title":"Nat Bur Stand Appl Math Ser"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177692552"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.841190"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557588"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483380"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_30"},{"key":"ref6","first-page":"84","article-title":"A simply realizable ideal cryptographic system","volume":"36","author":"ryabko","year":"2000","journal-title":"Problems of Information Transmission"},{"journal-title":"Information-theoretic metrics for security and privacy (Doctoral dissertation Massachusetts Institute of Technology)","year":"0","author":"calmon","key":"ref5"},{"key":"ref8","article-title":"Honey encryption beyond message recovery security","author":"joseph","year":"2016","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_17"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864438"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946015010093"},{"journal-title":"Thomas Elements of information theory","year":"2006","author":"cover","key":"ref20"},{"key":"ref22","first-page":"163","article-title":"The fast enumeration of combinatorial objects","volume":"10","author":"ryabko","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"ref21","first-page":"311","article-title":"1966 Optimal coding in the case of unknown and changing message statistics","volume":"2","author":"fitingof","year":"1966","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12564-6"},{"journal-title":"Ergodic Theory and Information","year":"1965","author":"billingsley","key":"ref23"}],"event":{"name":"2022 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2022,11,1]]},"location":"Mumbai, India","end":{"date-parts":[[2022,11,9]]}},"container-title":["2022 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9965754\/9965755\/09965864.pdf?arnumber=9965864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:42:41Z","timestamp":1672083761000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9965864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,1]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/itw54588.2022.9965864","relation":{},"subject":[],"published":{"date-parts":[[2022,11,1]]}}}