Name
Abstract | ||
|---|---|---|
Compressed sensing (CS) has recently emerged as an effective and efficient way to encrypt data. Under certain conditions, it has been shown to provide some secrecy notions. In theory, it could be considered to be a perfect match for constrained devices needing to acquire and protect the data with computationally cheap operations. However, the theoretical results on the secrecy of compressive cryptosystems only hold under the assumption of infinite precision representation. With this work, we aim to close this gap and lay the theoretical foundations to support this practical framework. We provide theoretical upper bounds on the distinguishability of the measurements acquired through finite precision sensing matrices and experimentally validate them. Our main result is that the secrecy of a CS cryptosystem can be exponentially increased with a linear increase in the representation precision. This result confirms that the CS can be an effective secrecy layer and provides tools to use it in practical settings. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/tifs.2019.2918089 | IEEE Transactions on Information Forensics and Security |
Keywords | Field | DocType |
Sensors,Encryption,Gaussian distribution,Compressed sensing,Sparse matrices,Energy measurement | Pattern recognition,Computer science,Matrix (mathematics),Secrecy,Algorithm,Cryptosystem,Encryption,Artificial intelligence,Quantization (signal processing),Sparse matrix,Compressed sensing | Journal |
Volume | Issue | ISSN |
15 | 1 | 1556-6013 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matteo Testa | 1 | 6 | 3.15 |
| Tiziano Bianchi | 2 | 1003 | 62.55 |
| Enrico Magli | 3 | 1319 | 114.81 |