{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T08:55:54Z","timestamp":1768467354427,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10623-023-01195-8","type":"journal-article","created":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T13:03:03Z","timestamp":1677502983000},"page":"2201-2212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Unconditionally secure short key ciphers based on data compression and randomization"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7232-9644","authenticated-orcid":false,"given":"Boris","family":"Ryabko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"key":"1195_CR1","doi-asserted-by":"crossref","unstructured":"Agrikola T., Couteau G., Ishai Y., Jarecki S., Sahai A.: On pseudorandom encodings. In: Theory of Cryptography Conference, pp. 639\u2013669. Springer, Cham (2020).","DOI":"10.1007\/978-3-030-64381-2_23"},{"key":"1195_CR2","volume-title":"Ergodic Theory and Information","author":"P Billingsley","year":"1965","unstructured":"Billingsley P.: Ergodic Theory and Information. Wiley, Hoboken (1965)."},{"key":"1195_CR3","doi-asserted-by":"crossref","unstructured":"Calmon F.D.: Information-theoretic metrics for security and privacy (Doctoral dissertation, Massachusetts Institute of Technology) (2015).","DOI":"10.1109\/ALLERTON.2014.7028548"},{"key":"1195_CR4","volume-title":"Elements of information theory","author":"TM Cover","year":"2006","unstructured":"Cover T.M., Thomas J.A.: Elements of information theory. Wiley, New York (2006)."},{"key":"1195_CR5","doi-asserted-by":"crossref","unstructured":"Dodis Y., Smith A.: Entropic security and the encryption of high entropy messages. In: Theory of Cryptography Conference, pp. 556\u2013577. Springer, Berlin (2005).","DOI":"10.1007\/978-3-540-30576-7_30"},{"key":"1195_CR6","doi-asserted-by":"crossref","unstructured":"du Pin Calmon F., Medard M.L.M., Zeger L.M., Barros J., Christiansen M.M., Duffy K.R.: Lists that are smaller than their parts: a coding approach to tunable secrecy. In: 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, October 1\u20135, pp. 1387\u20131394. IEEE (2012).","DOI":"10.1109\/Allerton.2012.6483380"},{"issue":"3","key":"1195_CR7","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1214\/aoms\/1177692552","volume":"43","author":"P Elias","year":"1972","unstructured":"Elias P.: The efficient construction of an unbiased random sequence. Ann. Math. Stat. 43(3), 864\u2013870 (1972).","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"1195_CR8","first-page":"3","volume":"2","author":"BM Fitingof","year":"1966","unstructured":"Fitingof B.M.: Optimal coding in the case of unknown and changing message statistics. Probl. Peredachi Inform. 2(2), 3\u201311 (1966).","journal-title":"Probl. Peredachi Inform."},{"key":"1195_CR9","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EW Gilbert","year":"1959","unstructured":"Gilbert E.W., Moore E.F.: Variable length binary encoding. Bell. Syst. Tech. J. 38, 933\u2013967 (1959).","journal-title":"Bell. Syst. Tech. J."},{"key":"1195_CR10","doi-asserted-by":"crossref","unstructured":"Gunther C.G.: A universal algorithm for homophonic coding. In: Workshop on the Theory and Application of Cryptographic Techniques, pp. 405\u2013414. Springer, Berlin (1988).","DOI":"10.1007\/3-540-45961-8_37"},{"key":"1195_CR11","doi-asserted-by":"crossref","unstructured":"Jaeger J., Ristenpart T., Tang Q.: Honey encryption beyond message recovery security. In: Advances in Cryptology-EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8\u201312, Proceedings, Part I 3, pp. 758\u2013788. Springer, Berlin (2016).","DOI":"10.1007\/978-3-662-49890-3_29"},{"key":"1195_CR12","doi-asserted-by":"crossref","unstructured":"Juels A., Ristenpart T.: Honey encryption: security beyond the bruteforce bound. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 293\u2013310. Springer, Berlin (2014).","DOI":"10.1007\/978-3-642-55220-5_17"},{"key":"1195_CR13","volume-title":"Universal compression and retrival","author":"R Krichevsky","year":"1993","unstructured":"Krichevsky R.: Universal compression and retrival. Kluver Academic Publishers, New York (1993)."},{"key":"1195_CR14","unstructured":"Li X., Tang Q., Zhang Z.: Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective. In: 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Schloss Dagstuhl-Leibniz-Zentrum Informatik (2021)."},{"issue":"3","key":"1195_CR15","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TIT.2005.864438","volume":"52","author":"A Russell","year":"2006","unstructured":"Russell A., Wang H.: How to fool an unbounded adversary with a short key. IEEE Trans. Inf. Theory. 52(3), 1130\u201340 (2006).","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"2","key":"1195_CR16","first-page":"163","volume":"10","author":"BY Ryabko","year":"1998","unstructured":"Ryabko B.Y.: The fast enumeration of combinatorial objects. Discret. Math. Appl. 10(2), 163\u2013182 (1998).","journal-title":"Discret. Math. Appl."},{"issue":"1","key":"1195_CR17","first-page":"84","volume":"36","author":"B Ryabko","year":"2000","unstructured":"Ryabko B.: A simply realizable ideal cryptographic system. Probl. Inf. Transm. 36(1), 84\u201389 (2000) (see also IACR Cryptology ePrint archive, report 2001\/046).","journal-title":"Probl. Inf. Transm."},{"issue":"1","key":"1195_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1134\/S0032946015010093","volume":"51","author":"B Ryabko","year":"2015","unstructured":"Ryabko B.: The Vernam Cipher is robust to small deviations from randomness. Probl. Inf. Transm. 51(1), 82\u201386 (2015).","journal-title":"Probl. Inf. Transm."},{"key":"1195_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-12564-6","volume-title":"Asymptotic nonparametric statistical analysis of stationary time series","author":"D Ryabko","year":"2019","unstructured":"Ryabko D.: Asymptotic nonparametric statistical analysis of stationary time series. Springer, New York (2019)."},{"issue":"6","key":"1195_CR20","doi-asserted-by":"publisher","first-page":"2083","DOI":"10.1109\/18.782143","volume":"45","author":"B Ryabko","year":"1999","unstructured":"Ryabko B., Fionov A.: Efficient homophonic coding. IEEE Trans. Inf. Theory 45(6), 2083\u20132091 (1999).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1195_CR21","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/18.841190","volume":"46","author":"B Ryabko","year":"2000","unstructured":"Ryabko B., Matchikina E.: Fast and efficient construction of an unbiased random sequence. IEEE Trans. Inf. Theory 46(3), 1090\u20131093 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1195_CR22","doi-asserted-by":"crossref","unstructured":"Ryabko B., Ryabko D.: Information\u2013theoretic approach to steganographic systems. In: IEEE International Symposium on Information Theory, Proceedings, 2461\u20132464. https:\/\/eprint.iacr.org\/2006\/063 (2007).","DOI":"10.1109\/ISIT.2007.4557588"},{"issue":"4","key":"1195_CR23","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949).","journal-title":"Bell Syst. Tech. J."},{"key":"1195_CR24","first-page":"36","volume":"12","author":"J von Neumann","year":"1951","unstructured":"von Neumann J.: Various techniques used in connection with random digits. Nat. Bur. Stand. Appl. Math. Ser. 12, 36\u201338 (1951) (Reprinted in the Collected Works of von Neumann, vol. 5).","journal-title":"Nat. Bur. Stand. Appl. Math. Ser."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01195-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01195-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01195-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T16:12:43Z","timestamp":1685031163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01195-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1195"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01195-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"30 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}