10 citations · 40 across the 30 of their papers we have counts for
3 papers · 1 filter
Computationally Efficient Covert Communication
Qiaosheng Zhang, Mayank Bakshi, Sidharth Jaggi
In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as fol…
Arbitrarily Varying Networks: Capacity-achieving Computationally Efficient Codes
Peida Tian, Sidharth Jaggi, Mayank Bakshi +1
We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communicatio…
Plausible Deniability over Broadcast Channels
Mayank Bakshi, Vinod Prabhakaran
In this paper, we introduce the notion of Plausible Deniability in an information theoretic framework. We consider a scenario where an entity that eavesdrops through a broadcast ch…