Authors:Valerio Cambareri, Mauro Mangia, Fabio Pareschi, Riccardo Rovatti, Gianluca Setti Abstract:[Part II] On Known-Plaintext Attacks to a Compressed Sensing-based Encryption: a Quantitative Analysis Abstract:Despite the linearity of its encoding, compressed
sensing may be used to provide a limited form of data protection
when random encoding matrices are used to produce sets of
low-dimensional measurements (ciphertexts). In this paper we
quantify by theoretical means the resistance of the least complex
form of this kind of encoding against known-plaintext attacks.
For both standard compressed sensing with antipodal random
matrices and recent multiclass encryption schemes based on it,
we show how the number of candidate encoding matrices that
match a typical plaintext-ciphertext pair is so large that the
search for the true encoding matrix inconclusive. Such results on
the practical ineffectiveness of known-plaintext attacks underlie
the fact that even closely-related signal recovery under encoding
matrix uncertainty is doomed to fail.
Practical attacks are then exemplified by applying compressed
sensing with antipodal random matrices as a multiclass encryption
scheme to signals such as images and electrocardiographic
tracks, showing that the extracted information on the true
encoding matrix from a plaintext-ciphertext pair leads to no
significant signal recovery quality increase. This theoretical and
empirical evidence clarifies that, although not perfectly secure,
both standard compressed sensing and multiclass encryption
schemes feature a noteworthy level of security against knownplaintext
attacks, therefore increasing its appeal as a negligible cost
encryption method for resource-limited sensing applications. Publication Status:Available on IEEE Xplore. Part II: Pending peer review on the IEEE Transactions on Information Forensics and Security. Draft available upon request. BibTeX Entries:author={Cambareri, V. and Mangia, M. and Pareschi, F. and Rovatti, R. and Setti, G.}, journal={IEEE Transactions on Signal Processing}, title={Low-Complexity Multiclass Encryption by Compressed Sensing}, year={2015}, month={May}, volume={63}, number={9}, pages={2183-2195}, keywords={Channel coding;Compressed sensing;Decoding;Encryption;Receivers;Compressed sensing;encryption;secure communications;security}, doi={10.1109/TSP.2015.2407315}, ISSN={1053-587X},} Attachments:The supporting code is hosted at Google Code due to the variety of experiments proposed in the two papers. |

Compressed Sensing >