Information Bytes

Matthieu Bloch
School of Electrical and Computer Engineering
Georgia Institute of Technology

Recent works

  1. K. S. K. Arumugam and M. R. Bloch, “Embedding Covert Information in Broadcast Communications,” IEEE Transactions on Information Forensics and Security, vol. 14, no. 10, pp. 2787–2801, Oct. 2019.
    DOI arXiv

    We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both receivers and a covert message to only one of them. The unintended recipient of the covert message is treated as an adversary who attempts to detect the covert transmission. This model captures the problem of embedding covert messages in an innocent codebook and generalizes previous covert communication models in which the innocent behavior corresponds to the absence of communication between legitimate users. We identify the exact asymptotic behavior of the number of covert bits that can be transmitted when the rate of the innocent codebook is close to the capacity of the channel to the adversary. Our results also identify the dependence of the number of covert bits on the channel parameters and the characteristics of the innocent codebook.

    @article{Arumugam2018b,
      author = {Arumugam, Keerthi Suria Kumar and Bloch, Matthieu R.},
      title = {Embedding Covert Information in Broadcast Communications},
      journal = {IEEE Transactions on Information Forensics and Security},
      year = {2019},
      volume = {14},
      number = {10},
      pages = {2787--2801},
      month = oct,
      doi = {10.1109/TIFS.2019.2907190},
      eprint = {1808.09556},
      groups = {Steganography and covert communications}
    }
    

  2. M. Tahmasbi, M. Bloch, and A. Yener, “In-Band Sensing of the Adversary’s Channel for Secure Communication in Wireless Channels,” in Proc. of IEEE International Symposium on Information Theory, Paris, France, Jul. 2019, pp. 2184–2188.

    @inproceedings{Tahmasbi2019c,
      author = {Tahmasbi, Mehrdad and Bloch, Matthieu and Yener, Aylin},
      title = {In-Band Sensing of the Adversary's Channel for Secure Communication in Wireless Channels},
      booktitle = {Proc. of IEEE International Symposium on Information Theory},
      year = {2019},
      pages = {2184-2188},
      address = {Paris, France},
      month = jul,
      file = {:2019-Tahmasbi-ISIT2.pdf:PDF},
      howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}}
    }
    

  3. I. A. Kadampot, M. Tahmasbi, and M. R. Bloch, “Codes for Covert Communication over Additive White Gaussian Noise Channels,” in Proc. of IEEE International Symposium on Information Theory, Paris, France, Jul. 2019, pp. 977–981.

    @inproceedings{Kadampot2019,
      author = {Kadampot, Ishaque Ashar and Tahmasbi, Mehrdad and Bloch, Matthieu R},
      title = {Codes for Covert Communication over Additive White Gaussian Noise Channels},
      booktitle = {Proc. of IEEE International Symposium on Information Theory},
      year = {2019},
      pages = {977-981},
      address = {Paris, France},
      month = jul,
      file = {:2019-Kadampot-ISIT.pdf:PDF},
      howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}}
    }
    

  4. M. Tahmasbi and M. Bloch, “Steganography Protocols for Quantum Channels,” in Proc. of IEEE International Symposium on Information Theory, Paris, France, Jul. 2019, pp. 2179–2183.

    @inproceedings{Tahmasbi2019b,
      author = {Tahmasbi, Mehrdad and Bloch, Matthieu},
      title = {Steganography Protocols for Quantum Channels},
      booktitle = {Proc. of IEEE International Symposium on Information Theory},
      year = {2019},
      pages = {2179-2183},
      address = {Paris, France},
      month = jul,
      file = {:2019-Tahmasbi-ISIT.pdf:PDF},
      howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}}
    }
    


Recent posts