{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:53:57Z","timestamp":1755795237068,"version":"3.44.0"},"reference-count":36,"publisher":"Oxford University Press (OUP)","issue":"8","license":[{"start":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T00:00:00Z","timestamp":1742688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,14]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>A compression cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering both Huffman and arithmetic coding, this paper proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decrypted only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf023","type":"journal-article","created":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T07:38:17Z","timestamp":1740641897000},"page":"1062-1073","source":"Crossref","is-referenced-by-count":0,"title":["Compression Cryptosystem"],"prefix":"10.1093","volume":"68","author":[{"given":"Yoav","family":"Gross","sequence":"first","affiliation":[{"name":"Department of Computer Science , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]},{"name":"Ariel University , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]}]},{"given":"Shmuel T","family":"Klein","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Bar Ilan University , Ramat-Gan 52900 ,","place":["Israel"]}]},{"given":"Elina","family":"Opalinsky","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]},{"name":"Ariel University , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]}]},{"given":"Rivka","family":"Revivo","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]},{"name":"Ariel University , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]}]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]},{"name":"Ariel University , Data Science and Artificial Intelligence Research Center, , Ariel 40700 ,","place":["Israel"]}]}],"member":"286","published-online":{"date-parts":[[2025,3,23]]},"reference":[{"key":"2025081702470525000_ref1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/9591768","article-title":"Efficient compression and encryption for digital data transmission","volume":"2018","author":"Carpentieri","year":"2018","journal-title":"Secur Commun Netw"},{"key":"2025081702470525000_ref2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.5120\/20621-3342","article-title":"Data security using compression and cryptography techniques","volume":"117","author":"Sharma","year":"2015","journal-title":"Int J Comput Appl"},{"key":"2025081702470525000_ref3","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/TCSII.2008.2002565","article-title":"Embedding compression in chaos based cryptography","volume":"55","author":"Wong","year":"2008","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"key":"2025081702470525000_ref4","doi-asserted-by":"publisher","first-page":"104617","DOI":"10.1016\/j.ic.2020.104617","article-title":"Integrated encryption in dynamic arithmetic compression","volume":"279","author":"Klein","year":"2021","journal-title":"Inf Comput"},{"key":"2025081702470525000_ref5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.14569\/IJACSA.2017.080212","article-title":"Review of image compression and encryption techniques","volume":"8","author":"Setyaningsih","year":"2017","journal-title":"Int J Adv Comput Sci Appl"},{"key":"2025081702470525000_ref6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/23742917.2016.1226650","article-title":"Lightweight cryptography methods","volume":"1","author":"Buchanan","year":"2018","journal-title":"J Cyber Secur Technol"},{"key":"2025081702470525000_ref7","doi-asserted-by":"publisher","first-page":"3859","DOI":"10.1109\/TIFS.2021.3096026","article-title":"Compcrypt-lightweight ANS-based compression and encryption","volume":"16","author":"Camtepe","year":"2021","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2025081702470525000_ref8","doi-asserted-by":"publisher","DOI":"10.34768\/amcs-2023-0004","article-title":"Lightweight compression with encryption based on asymmetric numeral systems","volume":"33","author":"Duda","year":"2023","journal-title":"Int J Appl Math Comput Sci"},{"key":"2025081702470525000_ref9","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/s10207-022-00597-4","article-title":"ANS-based compression and encryption with 128-bit security","volume":"21","author":"Camtepe","year":"2022","journal-title":"Int J Inf Sec"},{"key":"2025081702470525000_ref10","first-page":"65","article-title":"The use of asymmetric numeral systems as an accurate replacement for Huffman coding","volume-title":"2015 Picture Coding Symposium, PCS 2015, Cairns, Australia, May 31 - June 3, 2015","author":"Duda","year":"2015"},{"key":"2025081702470525000_ref11","article-title":"Cryptography in data compression","volume":"2","author":"Wang","year":"2006","journal-title":"Code-Breakers Journal"},{"key":"2025081702470525000_ref12","first-page":"2369","article-title":"Simultaneous data compression and encryption","volume":"2","author":"Subhamastan Rao","year":"2011","journal-title":"Int J Comput Sci Inf Technol"},{"key":"2025081702470525000_ref13","first-page":"146","article-title":"Simultaneous arithmetic coding and encryption using chaotic maps","volume":"57","author":"Wong","year":"2010","journal-title":"IEEE Trans Circ Syst II Express Briefs"},{"key":"2025081702470525000_ref14","first-page":"113","volume-title":"Secure compression: Theory & Practice","author":"Kelley","year":"2014"},{"key":"2025081702470525000_ref15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.cose.2011.11.005","article-title":"On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression","volume":"31","author":"K\u00fclekci","year":"2012","journal-title":"Comput Secur"},{"key":"2025081702470525000_ref16","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.1002\/spe.2873","article-title":"Burrows-wheeler post-transformation with effective clustering and interpolative coding","volume":"50","author":"Niemi","year":"2020","journal-title":"Softw Pract Exp"},{"key":"2025081702470525000_ref17","doi-asserted-by":"publisher","first-page":"58","DOI":"10.5121\/ijnsa.2011.3305","article-title":"Data security using private key encryption system based on arithmetic coding","volume":"3","author":"Singh","year":"2011","journal-title":"Int J Netw Secur Its Appl"},{"key":"2025081702470525000_ref18","first-page":"1","article-title":"A study of joint lossless compression and encryption scheme","volume-title":"International Conference on Circuit, Power and Computing Technologies","author":"Raju","year":"2017"},{"key":"2025081702470525000_ref19","first-page":"1","article-title":"Combining Huffman text compression with new double encryption algorithm","volume-title":"C2SPCA Conference","author":"Sangwan","year":"2013"},{"key":"2025081702470525000_ref20","first-page":"1","article-title":"A simultaneous approach for compression and encryption techniques using deoxyribonucleic acid","volume-title":"2019 13th SKIMA Conference","author":"Zebari","year":"2019"},{"key":"2025081702470525000_ref21","article-title":"Breach: reviving the crime attack","volume-title":"Black Hat Conference, Las Vegas, USA, July 27\u2013August 1","author":"Gluck","year":"2013"},{"key":"2025081702470525000_ref22","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ipm.2003.08.008","article-title":"Pattern matching in Huffman encoded texts","volume":"41","author":"Klein","year":"2005","journal-title":"Inf Process Manag"},{"key":"2025081702470525000_ref23","first-page":"133","article-title":"A Huffman code based crypto-system","volume-title":"Data Compression Conference, DCC\u201922, Snowbird, UT, USA, March 22-25","author":"Gross","year":"2022"},{"key":"2025081702470525000_ref24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/spe.4380190207","article-title":"Word-based text compression","volume":"19","author":"Moffat","year":"1989","journal-title":"Softw Pract Exp"},{"key":"2025081702470525000_ref25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.6028\/NIST.FIPS.202","volume-title":"SHA-3 Standard: Permutation-based Hash and Extendable-output Functions","author":"Dworkin","year":"2015"},{"key":"2025081702470525000_ref26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01185434","article-title":"Complexity aspects of guessing prefix codes","volume":"12","author":"Fraenkel","year":"1994","journal-title":"Algorithmica"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey","key":"2025081702470525000_ref27"},{"key":"2025081702470525000_ref28","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/65943.65946","article-title":"Storing text retrieval systems on CD-ROM: compression and encryption considerations","volume":"7","author":"Klein","year":"1989","journal-title":"ACM Trans Inf Syst"},{"volume-title":"The Joy of Cryptography","year":"2021","author":"Rosulek","key":"2025081702470525000_ref29"},{"key":"2025081702470525000_ref30","first-page":"593","article-title":"An adaptive system for data compression","volume-title":"Record of the 7th Asilomar Conference on Circuits, Systems and Computers","author":"Faller","year":"1973"},{"key":"2025081702470525000_ref31","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","article-title":"Variations on a theme by Huffman","volume":"24","author":"Gallager","year":"1978","journal-title":"IEEE Trans Inf Theory"},{"key":"2025081702470525000_ref32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(85)90036-7","article-title":"Dynamic Huffman coding","volume":"6","author":"Knuth","year":"1985","journal-title":"J Algorithms"},{"key":"2025081702470525000_ref33","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","article-title":"Design and analysis of dynamic Huffman codes","volume":"34","author":"Vitter","year":"1987","journal-title":"J ACM"},{"article-title":"A brief analysis of data compression security issues","year":"2019","author":"Oliveira","key":"2025081702470525000_ref34"},{"key":"2025081702470525000_ref35","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On information and sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann Math Stat"},{"key":"2025081702470525000_ref36","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1016\/j.cnsns.2010.09.012","article-title":"A secure arithmetic coding based on Markov model","volume":"16","author":"Duan","year":"2011","journal-title":"Comm Nonlinear Sci Numer Simulat"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/8\/1062\/62524728\/bxaf023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/8\/1062\/62524728\/bxaf023.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T06:47:17Z","timestamp":1755413237000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/8\/1062\/8090573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,23]]},"references-count":36,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,3,23]]},"published-print":{"date-parts":[[2025,8,14]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf023","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2025,8]]},"published":{"date-parts":[[2025,3,23]]}}}