Analysis of One-Time Random Projections for Privacy Preserving Compressed Sensing

被引:113
作者
Bianchi, Tiziano [1 ]
Bioglio, Valerio [1 ]
Magli, Enrico [1 ]
机构
[1] Politecn Torino, Dept Elect & Telecommun, I-10129 Turin, Italy
基金
欧洲研究理事会;
关键词
Compressed sensing; confidentiality; encryption; privacy preservation; random matrices; security; INEQUALITIES; CONVERGENCE; INFORMATION; SECRECY; SECURE;
D O I
10.1109/TIFS.2015.2493982
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, the security of the compressed sensing (CS) framework as a form of data confidentiality is analyzed. Two important properties of one-time random linear measurements acquired using a Gaussian independent identically distributed matrix are outlined: 1) the measurements reveal only the energy of the sensed signal and 2) only the energy of the measurements leaks information about the signal. An important consequence of the above facts is that CS provides information theoretic secrecy in a particular setting. Namely, a simple strategy based on the normalization of the Gaussian measurements achieves, at least in theory, perfect secrecy, enabling the use of CS as an additional security layer in privacy preserving applications. In the generic setting in which CS does not provide information theoretic secrecy, two alternative security notions linked to the difficulty of estimating the energy of the signal and distinguishing equal-energy signals are introduced. Useful bounds on the mean square error of any possible estimator and the probability of error of any possible detector are provided and compared with the simulations. The results indicate that CS is in general not secure according to cryptographic standards, but may provide a useful built-in data obfuscation layer.
引用
收藏
页码:313 / 327
页数:15
相关论文
共 53 条
[1]   Compressive Sensing: From "Compressing while Sampling" to "Compressing and Securing while Sampling" [J].
Abdulghani, Amir M. ;
Rodriguez-Villegas, Esther .
2010 ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY (EMBC), 2010, :1127-1130
[2]  
Abramowitz M., 1964, HDB MATH FUNCTIONS F
[3]  
Agrawal S., 2011, IEEE Information Theory Workshop (ITW 2011), P563, DOI 10.1109/ITW.2011.6089519
[4]   INEQUALITIES FOR ZERO-BALANCED HYPERGEOMETRIC-FUNCTIONS [J].
ANDERSON, GD ;
BARNARD, RW ;
RICHARDS, KC ;
VAMANAMURTHY, MK ;
VUORINEN, M .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1995, 347 (05) :1713-1723
[5]   Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions [J].
Andoni, Alexandr ;
Indyk, Piotr .
COMMUNICATIONS OF THE ACM, 2008, 51 (01) :117-122
[6]  
[Anonymous], ICIP 2005
[7]  
[Anonymous], 1993, ESIMATION THEORY
[8]  
[Anonymous], 1997, Handbook of Applied Cryptography
[9]   On the rate of convergence in the entropic central limit theorem [J].
Artstein, S ;
Ball, KM ;
Barthe, F ;
Naor, A .
PROBABILITY THEORY AND RELATED FIELDS, 2004, 129 (03) :381-390
[10]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263