{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:56Z","timestamp":1725488696657},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540546207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-46416-6_23","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:02:07Z","timestamp":1186423327000},"page":"266-280","source":"Crossref","is-referenced-by-count":3,"title":["Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects"],"prefix":"10.1007","author":[{"given":"Colin","family":"Boyd","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"T. Bell, I.H. Witten and J.G. Cleary, Modeling for Text Compression, ACM Computing Surveys, 21,4, December 1989.","DOI":"10.1145\/76894.76896"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"G.V. Cormack and R.N.S. Horspool, Data Compression using Dynamic Markov Modelling, The Computer Journal, 30,6, 1987.","DOI":"10.1093\/comjnl\/30.6.541"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1109\/18.30993","volume":"IT-35","author":"P. Grassberger","year":"1989","unstructured":"P. Grassberger, Estimating the Information Content of Symbol Sequences and Efficient Codes, IEEE Transactions on Information Theory, IT-35,3, pp 669\u2013675, 1989.","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR4","unstructured":"C.G. G\u00fcnther, A Universal Algorithm for Homophonic Coding, Proceedings of Eurocrypt 88, Springer-Verlag, 1988."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"D.A. Huffman, A method for the Construction of Minimum-Redundancy Codes, Proceedings of the IERE, 40,9, 1952.","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"23_CR6","unstructured":"H.N. Jendal, Y.J.B. Kuhn and J.L. Massey, An Information-Theoretic Treatment of Homophonic Substitution, Proceedings of Eurocrypt 89, Springer-Verlag, 1990."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"G.G. Langdon, An Introduction to Arithmetic Coding, IBM Journal of Research and Development, 28,2, 1984.","DOI":"10.1147\/rd.282.0135"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"D.A. Lelewer and D.S. Hirschberg, Data Compression, ACM Computing Surveys, 13,3, 1987.","DOI":"10.1145\/45072.45074"},{"key":"23_CR9","unstructured":"R. Phillips and S. Jones, A 100 MBit\/s Adaptive Compressor Chip, Abstracts of Second Bangor Symposium on Communications, May 1990."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","volume":"IT-27","author":"J. Rissanen","year":"1981","unstructured":"J. Rissanen and G.G. Langdon, Universal Modelling and Coding, IEEE Transactions on Information Theory, IT-27,1, pp 12\u201323, 1981.","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"C.E. Shannon, Communication Theory of Secrecy Systems, Bell Systems Technical Journal, 656\u2013715, 1949.","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"23_CR12","unstructured":"C.E. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, 1949."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"M. Smid and D. Branstad, The Data Encryption Standard: Past and Future, Proceedings of the IEEE, 76,5, 1988.","DOI":"10.1109\/5.4441"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"H.C.A. van Tilborg, An Introduction to Cryptology, Kluwer Academic Publishers, 1988.","DOI":"10.1007\/978-1-4613-1693-0"},{"key":"23_CR15","volume-title":"Codes and Cryptography","author":"D. Welsh","year":"1988","unstructured":"D. Welsh, Codes and Cryptography, Clarendon Press, Oxford, 1988."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/0167-4048(88)90580-9","volume":"7","author":"I.H. Witten","year":"1988","unstructured":"I.H. Witten and J.G. Cleary, On the Privacy Afforded by Adaptive Text Compression, Computers and Security, 7, 1988, pp397\u2013408.","journal-title":"Computers and Security"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"I.H. Witten, R. Neal and J.G. Cleary, Arithmetic Coding for Data Compression, Communications of the ACM, 30,6, 1987.","DOI":"10.1145\/214762.214771"},{"issue":"3","key":"23_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT-23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, IT-23,3, pp 337\u2013343, 1977.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201991"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46416-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:11:25Z","timestamp":1605647485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46416-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540546207"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46416-6_23","relation":{},"subject":[]}}