Security at the Analog-to-Information Interface Using Compressed Sensing

The random projection scheme entailed by CS can be seen as a means to provide a very simple, limited, but straightforward means of encryption when the random encoding matrix at its core is generated given a private key between two parties in a communication channel. Conversely, signal recovery can be seen as a decoder which, given the measurements, retrieves the intended message as it was encoded via CS. From the security point of view such a scheme is not perfectly secure, but comes for free with the use of CS. Thus, this chapter explores what are the achievable, even if limited, security properties of CS, with the idea that it could serve as a low-complexity cryptographic stage acting directly at the analog-to-information interface. The approach we will adopt is three-fold: we will characterize statistical attacks, known-plaintext attacks, and signal recovery performances for non-perfectly informed receivers. Leveraging this last point, we will discuss a concept of “multiclass” encryption in which several receiver classes are distinguished depending on the accuracy of their encoding matrix. This exploration is completed by several experiments, showing how such principles can be implemented to secure image and biosignal communications that use CS as a basic building block.

[1]  Robert J. McEliece,et al.  A public key cryptosystem based on algebraic coding theory , 1978 .

[2]  Po-Ling Loh,et al.  Corrupted and missing predictors: Minimax bounds for high-dimensional linear regression , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[3]  Laurent Jacques,et al.  Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine , 2009, IEEE Transactions on Information Theory.

[4]  Enrico Magli,et al.  Analysis of the security of compressed sensing with circulant matrices , 2014, 2014 IEEE International Workshop on Information Forensics and Security (WIFS).

[5]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[6]  Laurent Jacques,et al.  Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.

[7]  Tara N. Sainath,et al.  Deep Neural Networks for Acoustic Modeling in Speech Recognition: The Shared Views of Four Research Groups , 2012, IEEE Signal Processing Magazine.

[8]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[9]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[10]  S. Sodin,et al.  Variations on the Berry-Esseen theorem , 2010, 1002.3970.

[11]  I. G. MacDonald,et al.  Polynomials Associated with Finite Gell-Complexes , 1971 .

[12]  H. Nishimori,et al.  Statistical Mechanics of an NP-complete Problem: Subset Sum , 2001 .

[13]  Thomas Strohmer,et al.  General Deviants: An Analysis of Perturbations in Compressed Sensing , 2009, IEEE Journal of Selected Topics in Signal Processing.

[14]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.

[15]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[16]  Kwok-Wo Wong,et al.  Bi-level Protected Compressive Sampling , 2016, IEEE Transactions on Multimedia.

[17]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[18]  J. Tropp,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, Commun. ACM.

[19]  Philip Schniter,et al.  Expectation-maximization Bernoulli-Gaussian approximate message passing , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[20]  E. Magli,et al.  Secure compressed sensing over finite fields , 2014, 2014 IEEE International Workshop on Information Forensics and Security (WIFS).

[21]  Enrico Magli,et al.  Analysis of One-Time Random Projections for Privacy Preserving Compressed Sensing , 2016, IEEE Transactions on Information Forensics and Security.

[22]  Sundeep Rangan,et al.  Generalized approximate message passing for estimation with random linear mixing , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[23]  P. Billingsley,et al.  Probability and Measure , 1980 .

[24]  A. C. Berry The accuracy of the Gaussian approximation to the sum of independent variates , 1941 .

[25]  Franz Pernkopf,et al.  A Pitch Tracking Corpus with Evaluation on Multipitch Tracking Scenario , 2011, INTERSPEECH.

[26]  Jeffrey M. Hausdorff,et al.  Physionet: Components of a New Research Resource for Complex Physiologic Signals". Circu-lation Vol , 2000 .

[27]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[28]  Mariko Hagita,et al.  Cryptographic Mersenne Twister and Fubuki Stream/block Cipher , 2005, IACR Cryptol. ePrint Arch..

[29]  Volkan Cevher,et al.  Compressive sensing under matrix uncertainties: An Approximate Message Passing approach , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).

[30]  Y. Rachlin,et al.  The secrecy of compressed sensing measurements , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[31]  Riccardo Rovatti,et al.  On Known-Plaintext Attacks to a Compressed Sensing-Based Encryption: A Quantitative Analysis , 2013, IEEE Transactions on Information Forensics and Security.

[32]  S. Geman A Limit Theorem for the Norm of Random Matrices , 1980 .

[33]  Ray Smith An Overview of the Tesseract OCR Engine , 2007 .

[34]  Yonina C. Eldar,et al.  Performance bounds for sparse estimation with random noise , 2009, 2009 IEEE/SP 15th Workshop on Statistical Signal Processing.

[35]  Georgios B. Giannakis,et al.  Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling , 2010, IEEE Transactions on Signal Processing.

[36]  Enrico Magli,et al.  On the security of random linear measurements , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[37]  Andrew Odlyzko,et al.  The Rise and Fall of Knapsack Cryptosystems , 1998 .

[38]  Robin Fay,et al.  Introducing the counter mode of operation to Compressed Sensing based encryption , 2016, Inf. Process. Lett..

[39]  Kwok-Wo Wong,et al.  A two-class information concealing system based on compressed sensing , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[40]  Yonina C. Eldar,et al.  The Cramér-Rao Bound for Estimating a Sparse Parameter Vector , 2010, IEEE Transactions on Signal Processing.

[41]  Jeffrey C. Lagarias,et al.  Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[42]  G. Sharma,et al.  On the security and robustness of encryption via compressed sensing , 2008, MILCOM 2008 - 2008 IEEE Military Communications Conference.

[43]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[44]  Stéphane Mallat,et al.  A Wavelet Tour of Signal Processing - The Sparse Way, 3rd Edition , 2008 .

[45]  R. Latala Some estimates of norms of random matrices , 2005 .

[46]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[47]  Riccardo Rovatti,et al.  Submitted to Ieee Transactions on Signal Processing Low-complexity Multiclass Encryption by Compressed Sensing Part I: Definition and Main Properties , 2022 .

[48]  Po-Ling Loh,et al.  High-dimensional regression with noisy and missing data: Provable guarantees with non-convexity , 2011, NIPS.

[49]  R. Jane,et al.  Evaluation of an automatic threshold based detector of waveform limits in Holter ECG with the QT database , 1997, Computers in Cardiology 1997.

[50]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[51]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.