Submitted to Ieee Transactions on Signal Processing Low-complexity Multiclass Encryption by Compressed Sensing Part I: Definition and Main Properties

The idea that compressed sensing may be used to encrypt information from unauthorized receivers has already been envisioned but never explored in depth since its security may seem compromised by the linearity of its encoding process. In this paper, we apply this simple encoding to define a general private-key encryption scheme in which a transmitter distributes the same encoded measurements to receivers of different classes, which are provided partially corrupted encoding matrices and are thus allowed to decode the acquired signal at provably different levels of recovery quality. The security properties of this scheme are thoroughly analyzed: first, the properties of our multiclass encryption are theoretically investigated by deriving performance bounds on the recovery quality attained by lower-class receivers with respect to high-class ones. Then, we perform a statistical analysis of the measurements to show that, although not perfectly secure, compressed sensing grants some level of security that comes at almost-zero cost and thus may benefit resource-limited applications. In addition to this, we report some exemplary applications of multiclass encryption by compressed sensing of speech signals, electrocardiographic tracks and images, in which quality degradation is quantified as the impossibility of some feature extraction algorithms to obtain sensitive information from suitably degraded signal recoveries.

[1]  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).

[2]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[3]  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.

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

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

[6]  Magda Peligrad,et al.  CENTRAL LIMIT THEOREM FOR LINEAR PROCESSES , 1997 .

[7]  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).

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

[9]  R. Smith,et al.  An Overview of the Tesseract OCR Engine , 2007, Ninth International Conference on Document Analysis and Recognition (ICDAR 2007).

[10]  Meng Zhang,et al.  Energy-efficient and Secure Sensor Data Transmission Using Encompression , 2013, 2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems.

[11]  Ting Sun,et al.  Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..

[12]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[13]  A. Robert Calderbank,et al.  Sensitivity to Basis Mismatch in Compressed Sensing , 2011, IEEE Trans. Signal Process..

[14]  S. Mallat A wavelet tour of signal processing , 1998 .

[15]  Yonina C. Eldar,et al.  Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals , 2007, IEEE Transactions on Signal Processing.

[16]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

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

[18]  M. Vetterli,et al.  Sensing reality and communicating bits: a dangerous liaison , 2006, IEEE Signal Processing Magazine.

[19]  D. Donoho,et al.  Counting faces of randomly-projected polytopes when the projection radically lowers dimension , 2006, math/0607364.

[20]  Yong Wang,et al.  A survey of security issues in wireless sensor networks , 2006, IEEE Communications Surveys & Tutorials.

[21]  Wade Trappe,et al.  Introduction to Cryptography with Coding Theory , 2002 .

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

[23]  Michael P. Friedlander,et al.  Probing the Pareto Frontier for Basis Pursuit Solutions , 2008, SIAM J. Sci. Comput..

[24]  Vladimir Stojanovic,et al.  Design and Analysis of a Hardware-Efficient Compressed Sensing Architecture for Data Compression in Wireless Sensors , 2012, IEEE Journal of Solid-State Circuits.

[25]  R. Lata,et al.  SOME ESTIMATES OF NORMS OF RANDOM MATRICES , 2004 .

[26]  Richard G. Baraniuk,et al.  Kronecker Compressive Sensing , 2012, IEEE Transactions on Image Processing.

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

[28]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[29]  Michael P. Friedlander,et al.  Sparse Optimization with Least-Squares Constraints , 2011, SIAM J. Optim..

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

[31]  Riccardo Rovatti,et al.  A Pragmatic Look at Some Compressive Sensing Architectures With Saturation and Quantization , 2012, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[32]  Manuel Blum,et al.  A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..

[33]  Justin K. Romberg,et al.  Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals , 2009, IEEE Transactions on Information Theory.

[34]  Cishen Zhang,et al.  Robustly Stable Signal Recovery in Compressed Sensing With Structured Matrix Perturbation , 2011, IEEE Transactions on Signal Processing.

[35]  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).

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

[37]  Vincent Rijmen,et al.  The Design of Rijndael: AES - The Advanced Encryption Standard , 2002 .

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

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

[40]  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.

[41]  J. Norris Appendix: probability and measure , 1997 .

[42]  Stephen J. Wright,et al.  Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.

[43]  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.

[44]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[45]  Deanna Needell,et al.  CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , 2008, ArXiv.

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

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

[48]  M. Rudelson,et al.  Non-asymptotic theory of random matrices: extreme singular values , 2010, 1003.2990.

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

[50]  E. Fischer Über quadratische Formen mit reellen Koeffizienten , 1905 .

[51]  Yonina C. Eldar,et al.  Xampling: Signal Acquisition and Processing in Union of Subspaces , 2009, IEEE Transactions on Signal Processing.

[52]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

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

[54]  Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers, ACSCC 2011, Pacific Grove, CA, USA, November 6-9, 2011 , 2011, ACSCC.

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

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

[57]  Kari Karhunen,et al.  Über lineare Methoden in der Wahrscheinlichkeitsrechnung , 1947 .

[58]  Riccardo Rovatti,et al.  Low-complexity Multiclass Encryption by Compressed Sensing, Part II: Known-Plaintext Attacks , 2013, ArXiv.

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

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

[61]  David L. Donoho,et al.  Precise Undersampling Theorems , 2010, Proceedings of the IEEE.

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