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.

Secrecy Analysis of Finite-Precision Compressive Cryptosystems / Testa, Matteo; Bianchi, T.; Magli, E.. - In: IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY. - ISSN 1556-6013. - STAMPA. - 15:(2020), pp. 1-13. [10.1109/TIFS.2019.2918089]

Secrecy Analysis of Finite-Precision Compressive Cryptosystems

TESTA, MATTEO;Bianchi T.;Magli E.
2020

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.
File in questo prodotto:
File Dimensione Formato  
test_TIFS2019.pdf

non disponibili

Descrizione: articolo versione publisher
Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 2.07 MB
Formato Adobe PDF
2.07 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
test_TIFS2019_OA.pdf

accesso aperto

Descrizione: articolo versione autore
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 1.7 MB
Formato Adobe PDF
1.7 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11583/2752412
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo