The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
On Compressing Encrypted Data
Abstract
When it is desired to transmit redundant data over an insecure and bandwidth-constrained channel, it is customary to first compress the data and then encrypt it. In this paper, we investigate the novelty of reversing the order of these steps, i.e., first encrypting and then compressing, without compromising either the compression efficiency or the information-theoretic security. Although counter-intuitive, we show surprisingly that, through the use of coding with side information principles, this reversal of order is indeed possible in some settings of interest without loss of either optimal coding efficiency or perfect secrecy. We show that in certain scenarios our scheme requires no more randomness in the encryption key than the conventional system where compression precedes encryption. In addition to proving the theoretical feasibility of this reversal of operations, we also describe a system which implements compression of encrypted data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 2×
“Shannon [7] that assumed lossless recovery (zero distortion) of the source at the decoder.”
BackgroundWyner, A. D. (1975) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1975.tb02040.x · Cited by 7,075
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Noiseless coding of correlated information sources
Slepian, D., & Wolf, J. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055037 · Cited by 3,952
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Cited by
Reversible Data Hiding in Encrypted Images by Reserving Room Before Encryption
Ma, K., Zhang, W., Zhao, X., Yu, N., & Li, F. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2248725 · Cited by 751
High Capacity Reversible Data Hiding in Encrypted Images by Patch-Level Sparse Representation
Cao, X., Du, L., Wei, X., Meng, D., & Guo, X. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2423678 · Cited by 380
Reversible Data Hiding in Encrypted Images With Distributed Source Encoding
Qian, Z., & Zhang, X. (2016) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2015.2418611 · Cited by 313
Encryption-Then-Compression Systems Using Grayscale-Based Image Encryption for JPEG Images
Chuman, T., Sirichotedumrong, W., & Kiya, H. (2019) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2018.2881677 · Cited by 252
Zhou, J., Liu, X., Au, O. C., & Tang, Y. Y. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2291625 · Cited by 192
Metadata
- Authors
- Johnson, M., Ishwar, P., Prabhakaran, V., Schonberg, D., & Ramchandran, K.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2004-10
- Volume
- 52
- Issue
- 10
- Pages
- 2992-3006
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2101647944
- Cited by
- 319
- References
- 18
- FWCI
- 10.87
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Compressing Encrypted Data. https://app.cochat.ai/papers/10.1109/tsp.2004.833860
- The paper
- Johnson, M., Ishwar, P., Prabhakaran, V., Schonberg, D., & Ramchandran, K. (2004). On Compressing Encrypted Data. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2004.833860
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.