The Secrecy of Compressed Sensing Measurements压缩感知测量的保密性.pptVIP

Allerton Allerton Allerton Allerton Allerton Allerton Allerton Allerton The Secrecy of Compressed Sensing Measurements Yaron Rachlin Dror Baron TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAA Alice wants to send Bob secret message. Message is K-sparse. Alice uses CS projection matrix to encode message. Does matrix act as encryption key? If Bob knows CS matrix, can recover message. Compressed Sensing (CS) Secrecy Scenario * Compressed Sensing Attack Scenario Eve intercepts message, does not know matrix. Can Eve recover secret message? * Is compressed sensing secure? Claims: “The encryption matrix can be viewed as a one-time pad that is completely secure” I. Drori “Compressed Video Sensing” BMVA Symposium on 3D Video - Analysis, Display and Applications, 2008. “effectively implements a?weak?form of?encryption ” D. Baron, M. F. Duarte, S. Sarvotham, M. B. Wakin and R. G. Baraniuk “An Information-Theoretic Approach to Distributed Compressed Sensing” Allerton 2005. * Notions of security Information theoretic – H(message|ciphertext)=H(message) Computationally unbounded adversary  Computational – Extracting message equivalent to solving computationally hard problem Computationally bounded adversary * Perfect Secrecy? Definition of perfect secrecy (Shannon). X message, Y ciphertext, I(X;Y)=0 Does CS-based encryption achieve perfect secrecy? NO Noiseless case: If message X=0, ciphertext Y=0. CS matrices satisfying RIP roughly preserve l2 norm. Mutual information is positive. Could mutual information be small? * Computational Secrecy Recovery is feasible, but hard for computationally bounded adversary. (Weaker) More widely used than perfect secrecy. How many matrices must an attacker try before finding the correct Phi matrix? Propose this as a computational notion of security for CS. * 264 keys could be an unfortunate predicament. Application Example: Biometrics Don’t want to store lots of data “in the