Bi-level Protected Compressive Sampling
Leo Yu Zhang, Kwok-Wo Wong, Yushu Zhang, Jiantao Zhou

TL;DR
This paper introduces a bi-level protected compressive sampling (BLP-CS) model that enhances security in CS-based encryption, allowing key reuse while resisting common attacks, especially suitable for resource-limited wireless sensors.
Contribution
The paper proposes a novel BLP-CS model utilizing artificial basis mismatch techniques and non-RIP matrices to enable secure, key-reusable compressive sampling.
Findings
Effective in resisting attacks with key reuse
Suitable for resource-limited wireless sensors
Simulation results validate the model's security and practicality
Abstract
Some pioneering works have investigated embedding cryptographic properties in compressive sampling (CS) in a way similar to one-time pad symmetric cipher. This paper tackles the problem of constructing a CS-based symmetric cipher under the key reuse circumstance, i.e., the cipher is resistant to common attacks even a fixed measurement matrix is used multiple times. To this end, we suggest a bi-level protected CS (BLP-CS) model which makes use of the advantage of the non-RIP measurement matrix construction. Specifically, two kinds of artificial basis mismatch techniques are investigated to construct key-related sparsifying bases. It is demonstrated that the encoding process of BLP-CS is simply a random linear projection, which is the same as the basic CS model. However, decoding the linear measurements requires knowledge of both the key-dependent sensing matrix and its sparsifying basis.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
