10 citations · 40 across the 30 of their papers we have counts for
25 papers · 1 filter
Authentication over Arbitrarily Varying Channels with Causal Adversaries
Mayank Bakshi, Vinod M. Prabhakaran, Bikash Kumar Dey +1
We study authentication over a discrete memoryless arbitrarily varying channel (AVC) in which the adversary selects the channel state causally based on past channel outputs. We pro…
Sequential Adversarial Hypothesis Testing
Eeshan Modak, Mayank Bakshi, Bikash Kumar Dey +1
We study the adversarial binary hypothesis testing problem in the sequential setting. Associated with each hypothesis is a closed, convex set of distributions. Given the hypothesis…
Byzantine Multiple Access Channels -- Part II: Communication With Adversary Identification
Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey +1
We introduce the problem of determining the identity of a byzantine user (internal adversary) in a communication system. We consider a two-user discrete memoryless multiple access…
On Authentication against a Myopic Adversary using Stochastic Codes
Mayank Bakshi, Oliver Kosut
We consider the problem of authenticated communication over a discrete arbitrarily varying channel where the legitimate parties are unaware of whether or not an adversary is presen…
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents
Eeshan Modak, Neha Sangwan, Mayank Bakshi +2
We study the Chernoff-Stein exponent of the following binary hypothesis testing problem: Associated with each hypothesis is a set of channels. A transmitter, without knowledge of t…
Byzantine Multiple Access Channels -- Part I: Reliable Communication
Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey +1
We study communication over a Multiple Access Channel (MAC) where users can possibly be adversarial. The receiver is unaware of the identity of the adversarial users (if any). When…