10 citations · 40 across the 30 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.IT2023
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…
cs.IT2023
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…
cs.IT2023
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…