{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,4]],"date-time":"2026-11-04T18:28:07Z","timestamp":1793816887287,"version":"4.6.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210009","type":"print"},{"value":"9783540246381","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24638-1_27","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:15:28Z","timestamp":1280747728000},"page":"491-504","source":"Crossref","is-referenced-by-count":5,"title":["On Compressing Encrypted Data without the Encryption Key"],"prefix":"10.1007","author":[{"given":"Mark","family":"Johnson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1996","unstructured":"Schneier, B.: Applied Cryptography. Wiley, New York (1996)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D.K. Slepian","year":"1973","unstructured":"Slepian, D.K., Wolf, J.K.: Noiseless Coding of Correlated Information Sources. IEEE Transactions on Information Theory\u00a019, 471\u2013480 (1973)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TIT.1982.1056524","volume":"28","author":"I. Csiszar","year":"1982","unstructured":"Csiszar, I.: Linear Codes for Sources and Source Networks: Error Exponents, Universal Coding. IEEE Transactions on Information Theory\u00a028, 585\u2013592 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Pradhan, S.S., Ramchandran, K.: Distributed Source Coding Using Syndromes (DISCUS): Design and Construction. In: Proceedings of the Data Compression Conference (DCC), Snowbird, UT (March 1999)","DOI":"10.1109\/DCC.1999.755665"},{"key":"27_CR6","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. In: 38th Symposium on Foundations of Computer Science, Miami Beach, FL (October 1997)"},{"key":"27_CR7","volume-title":"Error Control Systems for Digital Communication and Storage","author":"S. Wicker","year":"1995","unstructured":"Wicker, S.: Error Control Systems for Digital Communication and Storage. Prentice Hall, Englewood Cliffs (1995)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon Limit Error-Correcting Coding and Decoding: Turbo-Codes. In: IEEE International Conference on Communications, Geneva, Switzerland (May 1993)","DOI":"10.1109\/ICC.1993.397441"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Gallager, R.G.: Low Density Parity Check Codes. PhD thesis, MIT, Cambridge, MA (1963)","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M. Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander codes. IEEE Transactions on Information Theory\u00a042, 1710\u20131722 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR11","unstructured":"Schonberg, D., Ramchandran, K., Pradhan, S.S.: LDPC Codes Can Approach the Slepian Wolf Bound for General Binary Sources. In: 40th Annual Allerton Conference (October 2002)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Liveris, D., Xiong, Z., Georghiades, C.N.: Compression of Binary Sources with Side Information Using Low-Density Parity-Check Codes. IEEE Communication Letters (2002)","DOI":"10.1109\/LCOMM.2002.804244"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Garcia-Frias, J., Zhao, Y.: Compression of Correlated Binary Sources Using Turbo Codes. IEEE Communication Letters (October 2001)","DOI":"10.1109\/4234.957380"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Aaron, A., Girod, B.: Compression with Side Information Using Turbo Codes. In: IEEE Data Compression Conference (April 2002)","DOI":"10.1109\/DCC.2002.999963"},{"key":"27_CR15","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, New York (1997)"},{"key":"27_CR16","unstructured":"Witsenhausen, H., Wyner, A.D.: Interframe coder for video signals (1980) (United States Patent Number 4,191,970)"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Gamal, E., Orlitsky, A.: Interactive data compression. In: Proceedings 25th IEEE Symposium on Foundations of Computer Science, October 1984, pp. 100\u2013108 (1984)","DOI":"10.1109\/SFCS.1984.715906"},{"key":"27_CR18","unstructured":"Orlitsky, A.: Communication Issues in Distributed Computing. PhD thesis, Stanford University, Electrical Engineering Department (1986)"},{"issue":"4","key":"27_CR19","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1137\/S0097539792235864","volume":"24","author":"T. Feder","year":"1995","unstructured":"Feder, T., Kushilevitz, E., Naor, M., Nisan, N.: Amortized communication complexity. SIAM Journal on Computing\u00a024(4), 736\u2013750 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/0406043","volume":"6","author":"A. Orlitsky","year":"1993","unstructured":"Orlitsky, A.: Interactive communication of balanced distributions and of correlated files. SIAM J. Discret. Math.\u00a06, 548\u2013564 (1993)","journal-title":"SIAM J. Discret. Math."},{"key":"27_CR21","unstructured":"Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. In: Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics, pp. 197\u2013206 (2000)"},{"key":"27_CR22","first-page":"659","volume-title":"Proceedings of the 34th annual ACM symposium on Theory of computing","author":"M. Capalbo","year":"2002","unstructured":"Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings of the 34th annual ACM symposium on Theory of computing, pp. 659\u2013668. ACM Press, New York (2002)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24638-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:29:22Z","timestamp":1559345362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24638-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210009","9783540246381"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24638-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}