{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:03Z","timestamp":1760202483718},"reference-count":20,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Security"],"published-print":{"date-parts":[[1988,8]]},"DOI":"10.1016\/0167-4048(88)90580-9","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T10:42:38Z","timestamp":1034073758000},"page":"397-408","source":"Crossref","is-referenced-by-count":39,"title":["On the privacy afforded by adaptive text compression"],"prefix":"10.1016","volume":"7","author":[{"given":"Ian H.","family":"Witten","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John G.","family":"Cleary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-4048(88)90580-9_bib1","article-title":"An associative and impressible computer","author":"Cleary","year":"1980"},{"issue":"4","key":"10.1016\/0167-4048(88)90580-9_bib2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","article-title":"Data compression using adaptive coding and partial string machine","volume":"COM-32","author":"Cleary","year":"1984","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0167-4048(88)90580-9_bib3","article-title":"Data compression using dynamic Markov modelling","author":"Cormack","year":"1988","journal-title":"Comput. J."},{"issue":"4","key":"10.1016\/0167-4048(88)90580-9_bib4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TIT.1978.1055912","article-title":"A convergent gambling estimate of the entropy of English","volume":"IT-24","author":"Cover","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/0167-4048(88)90580-9_bib5","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1109\/TIT.1978.1055959","article-title":"Variations on a theme by Huffman","volume":"IT-24","author":"Gallager","year":"1978","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0167-4048(88)90580-9_bib6","series-title":"Research Monograph 30","article-title":"The estimation of probabilities","author":"Good","year":"1965"},{"issue":"3","key":"10.1016\/0167-4048(88)90580-9_bib7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/5505.5507","article-title":"Self-organizing linear search","volume":"17","author":"Hester","year":"1985","journal-title":"Comput. Surveys"},{"key":"10.1016\/0167-4048(88)90580-9_bib8","series-title":"Proc. Int. Conf. on the System Sciences","article-title":"Dynamic Markov modelling\u2014a prediction technique","author":"Horspool","year":"1986"},{"key":"10.1016\/0167-4048(88)90580-9_bib9","first-page":"1098","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman","year":"1952"},{"key":"10.1016\/0167-4048(88)90580-9_bib10","series-title":"Research Rep. RJ3128","article-title":"Tutorial on arithmetic coding","author":"Langdon","year":"1981"},{"key":"10.1016\/0167-4048(88)90580-9_bib11","article-title":"Source coding algorithms for fast data compression","author":"Pasco","year":"1976"},{"key":"10.1016\/0167-4048(88)90580-9_bib12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.203.0198","article-title":"Generalized Kraft inequality and arithmetic coding","volume":"20","author":"Rissanen","year":"1976","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0167-4048(88)90580-9_bib13","first-page":"44","article-title":"Arithmetic codings as number representations","volume":"31","author":"Rissanen","year":"1979","journal-title":"Acta Polytech. Scand., Math"},{"issue":"2","key":"10.1016\/0167-4048(88)90580-9_bib14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1147\/rd.232.0149","article-title":"Arithmetic coding","volume":"23","author":"Rissanen","year":"1979","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"10.1016\/0167-4048(88)90580-9_bib15","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","article-title":"Universal modeling and coding","volume":"IT-27","author":"Rissanen","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0167-4048(88)90580-9_bib16","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/j.1538-7305.1951.tb01366.x","article-title":"Prediction and entropy of printed English","author":"Shannon","year":"1951","journal-title":"Bell Syst. Tech. J."},{"issue":"6","key":"10.1016\/0167-4048(88)90580-9_bib17","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"IEEE Comput."},{"issue":"6","key":"10.1016\/0167-4048(88)90580-9_bib18","first-page":"520","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Commun. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/0167-4048(88)90580-9_bib19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"IT-23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/0167-4048(88)90580-9_bib20","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"IT-24","author":"Ziv","year":"1978","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Computers & Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167404888905809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167404888905809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:28:14Z","timestamp":1554906494000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167404888905809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0167404888905809"],"URL":"https:\/\/doi.org\/10.1016\/0167-4048(88)90580-9","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}