Keerthi Arumugam

Staff Engineer at Qualcomm.

Scholarly works

Articles
  1. K. S. K. Arumugam and M. R. Bloch, “Covert Communication over a K-User Multiple Access Channel,” IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 7020–7044, Nov. 2019.
    DOI arXiv

    We consider a scenario in which K transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless multiple-access channel (MAC) while simultaneously escaping detection from an adversary who observes their communication through another discrete memoryless MAC. We assume that each transmitter may use a secret key that is shared only between itself and the legitimate receiver. We show that each of the K transmitters can transmit on the order of sqrt(n) reliable and covert bits per n channel uses, exceeding which, the warden will be able to detect the communication. We identify the optimal pre-constants of the scaling, which leads to a complete characterization of the covert capacity region of the K-user binary-input MAC. We show that, asymptotically, all sum-rate constraints are inactive unlike the traditional MAC capacity region. We also characterize the channel conditions that have to be satisfied for the transmitters to operate without a secret key.

    @article{Arumugam2018a,
      author = {Arumugam, Keerthi Suria Kumar and Bloch, Matthieu R},
      title = {Covert Communication over a K-User Multiple Access Channel},
      journal = {IEEE Transactions on Information Theory},
      year = {2019},
      volume = {65},
      number = {11},
      pages = {7020-7044},
      month = nov,
      issn = {0018-9448},
      doi = {10.1109/TIT.2019.2930484},
      eprint = {1803.06007},
      file = {:2019-Arumugam-TransIT.pdf:PDF}
    }
    

  2. 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},
      file = {:2019-Arumugam-IEEETransIFS.pdf:PDF},
      groups = {Steganography and covert communications}
    }
    

Conference proceedings
  1. K. Arumugam, M. R. Bloch, and L. Wang, “Covert Communication over a Physically Degraded Relay Channel with Non-Colluding Wardens,” in Proc. of IEEE International Symposium on Information Theory, Vail, CO, Jun. 2018, pp. 766–770.
    DOI

    We analyze a physically degraded relay channel, in which the transmitter sends a covert message to the legitimate receiver with the help of a relay. Two wardens, who do not collude with each other, monitor communication from the transmitter and the relay, respectively, through two Discrete Memoryless Channels (DMCs) to detect the presence of a covert message. The objective of the transmitter is to deliver the covert message successfully to the receiver without exceeding the covertness threshold of either warden. We identify the optimal asymptotic scaling of message and key bits and the dependence of the covert throughput on the two covertness thresholds.

    @inproceedings{Arumugam2018,
      author = {Arumugam, Keerthi and Bloch, Matthieu R and Wang, Ligong},
      title = {Covert Communication over a Physically Degraded Relay Channel with Non-Colluding Wardens},
      booktitle = {Proc. of IEEE International Symposium on Information Theory},
      year = {2018},
      pages = {766--770},
      address = {Vail, CO},
      month = jun,
      doi = {10.1109/ISIT.2018.8437505},
      file = {:2018-Arumugam-ISIT.pdf:PDF},
      groups = {Steganography and covert communications},
      howpublished = {accepted to \emph{IEEE International Symposium on Information Theory}}
    }
    

  2. K. S. K. Arumugam and M. R. Bloch, “Covert communication over broadcast channels,” in Proc. of IEEE Information Theory Workshop, Kaohsiung, Taiwan, Nov. 2017, pp. 299–303.
    DOI

    We analyze a two-receiver binary-input discrete memoryless broadcast channel, in which the transmitter communicates a common message simultaneously to both users and a covert message to only one of them while treating the other as an adversary. This model captures the problem of embedding covert messages in an innocuous codebook and generalizes previous 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 reliable and covert bits when the rate of the innocuous codebook is close to the channel capacity of the adversary. In particular, our results characterize the dependence of the number of covert bits on the channel parameters and the characteristics of the innocent codebook.

    @inproceedings{Arumugam2017,
      author = {Arumugam, K. S. K. and Bloch, M. R.},
      title = {Covert communication over broadcast channels},
      booktitle = {Proc. of IEEE Information Theory Workshop},
      year = {2017},
      pages = {299--303},
      address = {Kaohsiung, Taiwan},
      month = nov,
      doi = {10.1109/ITW.2017.8278022},
      file = {:2017-Arumugam-ITW.pdf:PDF},
      groups = {Steganography and covert communications}
    }
    

  3. K. S. K. Arumugam, I. A. Kadampot, M. Tahmasbi, S. Shah, M. Bloch, and S. Pokutta, “Modulation recognition using side information and hybrid learning,” in Proc. IEEE Int. Symp. Dynamic Spectrum Access Networks (DySPAN), Piscataway, NJ, Mar. 2017, pp. 1–2.
    DOI

    Recent applications of machine learning to modulation recognition have demonstrated the potential of deep learning to achieve state-of-the-art performance. We propose to further extend this approach by using flexible time-space decompositions that are more in line with the actual learning task, as well as integrate side-information, such as higher order moments, directly into the training process. Our promising preliminary results suggest that there are many more benefits to be reaped from such approaches.

    @inproceedings{Arumugam2017a,
      author = {Arumugam, K. S. Kumar and Kadampot, I. A. and Tahmasbi, M. and Shah, S. and Bloch, M. and Pokutta, S.},
      title = {Modulation recognition using side information and hybrid learning},
      booktitle = {Proc. IEEE Int. Symp. Dynamic Spectrum Access Networks (DySPAN)},
      year = {2017},
      pages = {1--2},
      address = {Piscataway, NJ},
      month = mar,
      doi = {10.1109/DySPAN.2017.7920750},
      file = {:2017-Arumugam-Dyspan.pdf:PDF},
      groups = {Steganography and covert communications},
      keywords = {learning (artificial intelligence), modulation, telecommunication computing, deep learning, flexible time-space decompositions, higher order moments, machine learning, modulation recognition, side information, Cognitive radio, Convolution, Dynamic spectrum access, Machine learning, Modulation, Network architecture, Signal to noise ratio}
    }
    

  4. K. S. K. Arumugam and M. R. Bloch, “Keyless asynchronous covert communication,” in Proc. of IEEE Information Theory Workshop, Cambridge, United Kingdom, Sep. 2016, pp. 191–195.
    DOI

    We consider a scenario in which Alice asynchronously communicates with Bob over a Discrete Memoryless Channel (DMC) while escaping detection from an adversary who observes their communication through another DMC. Specifically, Alice transmits codewords of length n and chooses the transmission epoch T uniformly at random among N available time epochs, where N >> n. This deliberate symbol level-asynchronism forces the adversary to monitor a window of size N much larger than the codeword length n, and results in an increased covert throughput compared to the scenario without asynchronism. Our result generalizes a previous work in which asynchronism was introduced at the codeword level, i.e., having Alice choose a transmission window among non-overlapping windows of length n.

    @inproceedings{Arumugam2016a,
      author = {Arumugam, K. S. K. and Bloch, M. R.},
      title = {Keyless asynchronous covert communication},
      booktitle = {Proc. of IEEE Information Theory Workshop},
      year = {2016},
      pages = {191-195},
      address = {Cambridge, United Kingdom},
      month = sep,
      doi = {10.1109/ITW.2016.7606822},
      groups = {Steganography and covert communications},
      keywords = {Conferences;Monitoring},
      owner = {mattbloch},
      timestamp = {2016.03.20}
    }
    

  5. K. S. K. Arumugam and M. R. Bloch, “Keyless Covert Communication over Multiple-Access Channels,” in Proc. of IEEE International Symposium on Information Theory, Barcelona, Spain, Jul. 2016, pp. 2229–2233.
    DOI

    We consider a scenario in which two legitimate transmitters attempt to communicate with a legitimate receiver over a discrete memoryless Multiple-Access Channel (MAC), while escaping detection from an adversary who observes their communication through another discrete memoryless MAC. If the MAC to the legitimate receiver is "better" than the one to the adversary, in a sense that we make precise, then the legitimate users can reliably communicate on the order of sqrtn bits per n channel uses with arbitrarily Low Probability of Detection (LPD) without using a secret key. We also identify the pre-constants of the scaling, which leads to a characterization of the covert capacity region.

    @inproceedings{Arumugam2016,
      author = {Arumugam, Keerthi Suria Kumar and Bloch, Matthieu R.},
      title = {Keyless Covert Communication over Multiple-Access Channels},
      booktitle = {Proc. of IEEE International Symposium on Information Theory},
      year = {2016},
      pages = {2229-2233},
      address = {Barcelona, Spain},
      month = jul,
      doi = {10.1109/ISIT.2016.7541695},
      file = {:2016-Arumugam-ISIT.pdf:PDF},
      groups = {Steganography and covert communications},
      keywords = {Channel models;Encoding;Random variables;Receivers;Reliability;Transmitters},
      owner = {mattbloch},
      timestamp = {2016.01.26}
    }