• DocumentCode
    2455248
  • Title

    A compressed sensing wire-tap channel

  • Author

    Reeves, Galen ; Goela, Naveen ; Milosavljevic, Nebojsa ; Gastpar, Michael

  • Author_Institution
    Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA
  • fYear
    2011
  • fDate
    16-20 Oct. 2011
  • Firstpage
    548
  • Lastpage
    552
  • Abstract
    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.
  • Keywords
    Gaussian channels; matrix algebra; radio receivers; signal reconstruction; compressed sensing matrices; compressed sensing wire-tap channel; eavesdropper; lower bounds; multiplicative Gaussian wire-tap channel; radio receiver; sparse vector estimation; upper bounds; Channel capacity; Compressed sensing; Conferences; Entropy; Upper bound; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop (ITW), 2011 IEEE
  • Conference_Location
    Paraty
  • Print_ISBN
    978-1-4577-0438-3
  • Type

    conf

  • DOI
    10.1109/ITW.2011.6089562
  • Filename
    6089562