Skip to main content

A compressed sensing wire-tap channel

Publication ,  Journal Article
Reeves, G; Goela, N; Milosavljevic, N; Gastpar, M
Published in: 2011 IEEE Information Theory Workshop, ITW 2011
December 21, 2011

A multiplicative Gaussian wire-tap channel inspired by compressed sensing is studied. Lower and upper bounds on the secrecy capacity are derived, and shown to be relatively tight in the large system limit for a large class of compressed sensing matrices. Surprisingly, it is shown that the secrecy capacity of this channel is nearly equal to the capacity without any secrecy constraint provided that the channel of the eavesdropper is strictly worse than the channel of the intended receiver. In other words, the eavesdropper can see almost everything and yet learn almost nothing. This behavior, which contrasts sharply with that of many commonly studied wiretap channels, is made possible by the fact that a small number of linear projections can make a crucial difference in the ability to estimate sparse vectors. © 2011 IEEE.

Duke Scholars

Published In

2011 IEEE Information Theory Workshop, ITW 2011

DOI

Publication Date

December 21, 2011

Start / End Page

548 / 552
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Reeves, G., Goela, N., Milosavljevic, N., & Gastpar, M. (2011). A compressed sensing wire-tap channel. 2011 IEEE Information Theory Workshop, ITW 2011, 548–552. https://doi.org/10.1109/ITW.2011.6089562
Reeves, G., N. Goela, N. Milosavljevic, and M. Gastpar. “A compressed sensing wire-tap channel.” 2011 IEEE Information Theory Workshop, ITW 2011, December 21, 2011, 548–52. https://doi.org/10.1109/ITW.2011.6089562.
Reeves G, Goela N, Milosavljevic N, Gastpar M. A compressed sensing wire-tap channel. 2011 IEEE Information Theory Workshop, ITW 2011. 2011 Dec 21;548–52.
Reeves, G., et al. “A compressed sensing wire-tap channel.” 2011 IEEE Information Theory Workshop, ITW 2011, Dec. 2011, pp. 548–52. Scopus, doi:10.1109/ITW.2011.6089562.
Reeves G, Goela N, Milosavljevic N, Gastpar M. A compressed sensing wire-tap channel. 2011 IEEE Information Theory Workshop, ITW 2011. 2011 Dec 21;548–552.

Published In

2011 IEEE Information Theory Workshop, ITW 2011

DOI

Publication Date

December 21, 2011

Start / End Page

548 / 552