Mayank Bakshi

Mayank Bakshi


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 May 2017 in arXiv
Verified
Preprint
Open access
PDF file
MBMayank Bakshi
Mayank Bakshi
VPVinod Prabhakaran
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 channel summons one of the parties in a communication protocol to reveal their message (or signal vector). It is desirable that the summoned party have enough freedom to produce a fake output that is likely plausible given the eavesdropper's observation. We examine three variants of this problem -- Message Deniability, Transmitter Deniability, and Receiver Deniability. In the first setting, the message sender is summoned to produce the sent message. Similarly, in the second and third settings, the transmitter and the receiver are required to produce the transmitted codeword, and the received vector respectively. For each of these settings, we examine the maximum communication rate that allows a given minimum rate of plausible fake outputs. For the Message and Transmitter Deniability problems, we fully characterise the capacity region for general broadcast channels, while for the Receiver Deniability problem, we give an achievable rate region for physically degraded broadcast channels.

6 May 2016 in arXiv
Verified
Preprint
Open access
PDF file
PTPeida Tian
Peida Tian
SJSidharth Jaggi
Sidharth Jaggi
MBMayank Bakshi
Mayank Bakshi
OKOliver Kosut
Oliver Kosut
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 communications. We focus on omniscient node-based adversaries, i.e., the adversaries can control a subset of nodes, and know the message, network code and packets on all links. Characterizing information-theoretically optimal communication rates as a function of network parameters and bounds on the adversarially controlled network is in general open, even for unicast (single source, single destination) problems. In this work we characterize the information-theoretically optimal randomized capacity of such problems, i.e., under the assumption that the source node shares (an asymptotically negligible amount of) independent common randomness with each network node a priori (for instance, as part of network design). We propose a novel computationally-efficient communication scheme whose rate matches a natural information-theoretically "erasure outer bound" on the optimal rate. Our schemes require no prior knowledge of network topology, and can be implemented in a distributed manner as an overlay on top of classical distributed linear network coding.

5 January 2020 in arXiv
Verified
Preprint
Open access
PDF file
QIQiaosheng
Qiaosheng
EZEric Zhang
Eric Zhang
MBMatthieu Bloch
Matthieu Bloch
MBMayank Bakshi
Mayank Bakshi
SJSidharth Jaggi
Sidharth Jaggi
We consider the problem of covert communication over continuous-time additive white Gaussian noise (AWGN) channels under spectral mask constraints, wherein two legitimate parties attempt to communicate reliably in the presence of an eavesdropper that should be unable to estimate if communication takes place. The spectral mask constraint is imposed to restrict excessive radiation beyond the bandwidth of interest. We develop a communication scheme with theoretical reliability and covertness guarantees based on pulse amplitude modulation (PAM) with Binary Phase Shift Keying (BPSK) and root raised cosine (RRC) carrier pulses. Given a fixed transmission duration T and a spectral mask with bandwidth parameter W, we show that one can reliably and covertly transmit $O(\sqrt{WT})$ bits of information. We characterize the constant behind the $O$ and show that it is tight under some conditions.

27 January 2013 in arXiv
Verified
Preprint
Open access
PDF file
FHFarzin Haddadpour
Farzin Haddadpour
MSMahdi Jafari Siavoshani
Mahdi Jafari Siavoshani
MBMayank Bakshi
Mayank Bakshi
SJSidharth Jaggi
Sidharth Jaggi
In this work we study an Arbitrarily Varying Channel (AVC) with quadratic power constraints on the transmitter and a so-called "oblivious" jammer (along with additional AWGN) under a maximum probability of error criterion, and no private randomness between the transmitter and the receiver. This is in contrast to similar AVC models under the average probability of error criterion considered in [1], and models wherein common randomness is allowed [2] -- these distinctions are important in some communication scenarios outlined below. We consider the regime where the jammer's power constraint is smaller than the transmitter's power constraint (in the other regime it is known no positive rate is possible). For this regime we show the existence of stochastic codes (with no common randomness between the transmitter and receiver) that enables reliable communication at the same rate as when the jammer is replaced with AWGN with the same power constraint. This matches known information-theoretic outer bounds. In addition to being a stronger result than that in [1] (enabling recovery of the results therein), our proof techniques are also somewhat more direct, and hence may be of independent interest.

9 June 2018 in arXiv
Verified
Preprint
Open access
PDF file
QZQiaosheng Zhang
Qiaosheng Zhang
MBMayank Bakshi
Mayank Bakshi
SJSidharth Jaggi
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 follows: a transmitter Alice wishes to potentially reliably transmit a message to a receiver Bob, while ensuring that the transmission taking place is covert with respect to an eavesdropper Willie (who hears Alice's transmission over a noisier BSC). Prior works show that Alice can reliably and covertly transmit O(\sqrt{n}) bits over n channel uses without any shared secret between Alice and Bob. One drawback of prior works is that the computational complexity of the codes designed scales as 2^{\Theta(\sqrt{n})}. In this work we provide the first computationally tractable codes with provable guarantees on both reliability and covertness, while simultaneously achieving the best known throughput for the problem.

24 June 2021 in arXiv
Verified
Preprint
Open access
PDF file
QZQiaosheng Zhang
Qiaosheng Zhang
MBMayank Bakshi
Mayank Bakshi
SJSidharth Jaggi
Sidharth Jaggi
Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC(q)), and may maliciously flip (up to) a certain fraction p of their transmitted bits based on his observations. We consider a setting where the communication must be simultaneously covert as well as reliable, i.e., James should be unable to accurately distinguish whether or not Alice is communicating, while Bob should be able to correctly recover Alice's message with high probability regardless of the adversarial jamming strategy. We show that, unlike the setting with passive adversaries, covert communication against active adversaries requires Alice and Bob to have a shared key (of length at least Omega(log n)) even when Bob has a better channel than James. We present lower and upper bounds on the information-theoretically optimal throughput as a function of the channel parameters, the desired level of covertness, and the amount of shared key available. These bounds match for a wide range of parameters of interest. We also develop a computationally efficient coding scheme (based on concatenated codes) when the amount of shared key available is $\Omega(\sqrt{n} \log n)$, and further show that this scheme can be implemented with much less amount of shared key when the adversary is assumed to be computationally bounded.