5 citations · 6 across the 6 of their papers we have counts for
8 papers
Byzantine Distributed Function Computation
Hari Krishnan P. Anilkumar, Neha Sangwan, Varun Narayanan +1
We study the distributed function computation problem with users of which at most may be controlled by an adversary and characterize the set of functions of the sources the…
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…
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…
Consensus Capacity of Noisy Broadcast Channels
Neha Sangwan, Varun Narayanan, Vinod M. Prabhakaran
We study communication with consensus over a broadcast channel - the receivers reliably decode the sender's message when the sender is honest, and their decoder outputs agree even…
Compound Arbitrarily Varying Channels
Syomantak Chaudhuri, Neha Sangwan, Mayank Bakshi +2
We propose a communication model, that we call compound arbitrarily varying channels (CAVC), which unifies and generalizes compound channels and arbitrarily varying channels (AVC).…
Communication With Adversary Identification in Byzantine Multiple Access Channels
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…
Byzantine Multiple Access
Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey +1
We study communication over multiple access channels (MAC) where one of the users is possibly adversarial. When all users are non-adversarial, we want their messages to be decoded…