The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The secrecy of compressed sensing measurements
Abstract
Results in compressed sensing describe the feasibility of reconstructing sparse signals using a small number of linear measurements. In addition to compressing the signal, do these measurements provide secrecy? This paper considers secrecy in the context of an adversary that does not know the measurement matrix used to encrypt the signal. We demonstrate that compressed sensing-based encryption does not achieve Shannon's definition of perfect secrecy, but can provide a computational guarantee of secrecy.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Wireless sensor networks: a survey
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · Computer Networks · doi:10.1016/s1389-1286(01)00302-4 · Cited by 17,418
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
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 1×
“Shannon's work [19] pioneered this approach by introducing the idea of perfect secrecy.”
BackgroundDecoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Cited by
Javidi, B., Carnicer, A., Yamaguchi, M., Nomura, T., Pérez-Cabré, E., Millán, M. S., Nishchal, N. K., Torroba, R., Barrera, J. F., He, W., et al. (2016) · Journal of Optics · doi:10.1088/2040-8978/18/8/083001 · Cited by 460
Zhou, N., Zhang, A., Zheng, F., & Gong, L. (2014) · Optics & Laser Technology · doi:10.1016/j.optlastec.2014.02.015 · Cited by 325
A fast image encryption algorithm based on compressive sensing and hyperchaotic map
Xu, Q., Sun, K., Cao, C., & Zhu, C. (2019) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2019.04.011 · Cited by 280
A secure image encryption scheme with compression-confusion-diffusion structure
Zhu, S., Zhu, C., Fu, Y., Zhang, W., & Wu, X. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09699-4 · Cited by 19
Metadata
- Authors
- Rachlin, Y., & Baron, D.
- Venue
- 2008 46th Annual Allerton Conference on Communication, Control, and Computing
- Publisher
- IEEE
- Published
- 2008-09
- Pages
- 813-817
- OpenAlex
- W2534039953
- Cited by
- 344
- References
- 18
- FWCI
- 7.94
- Type
- conference paper
- 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: The secrecy of compressed sensing measurements. https://app.cochat.ai/papers/10.1109/allerton.2008.4797641
- The paper
- Rachlin, Y., & Baron, D. (2008). The secrecy of compressed sensing measurements. 2008 46th Annual Allerton Conference on Communication, Control, and Computing. https://doi.org/10.1109/allerton.2008.4797641
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.