Zobrazeno 1 - 10
of 192
pro vyhledávání: '"Prabhakaran, Vinod M."'
We study the problem of synthesising a two-user broadcast channel using a common message, where each output terminal shares an independent source of randomness with the input terminal. This generalises two problems studied in the literature (Cuff, IE
Externí odkaz:
http://arxiv.org/abs/2405.05211
We introduce the study of information leakage through \emph{guesswork}, the minimum expected number of guesses required to guess a random variable. In particular, we define \emph{maximal guesswork leakage} as the multiplicative decrease, upon observi
Externí odkaz:
http://arxiv.org/abs/2405.02585
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 channel where either user may deviate from the prescribed behaviour. S
Externí odkaz:
http://arxiv.org/abs/2309.11174
Autor:
Anilkumar, Hari Krishnan P., Rajesh, Aayush, Narayanan, Varun, Prabhakaran, Manoj M., Prabhakaran, Vinod M.
We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of shares reveal
Externí odkaz:
http://arxiv.org/abs/2304.14934
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 the hypothesis, chooses the vector of inputs to the channel. Given the
Externí odkaz:
http://arxiv.org/abs/2304.14166
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 all users are non-adversarial, we want their messages to be decoded r
Externí odkaz:
http://arxiv.org/abs/2211.12769
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 if the sender acts maliciously. We characterize the broadcast channels
Externí odkaz:
http://arxiv.org/abs/2205.06073
Autor:
Chaudhuri, Syomantak, Sangwan, Neha, Bakshi, Mayank, Dey, Bikash Kumar, Prabhakaran, Vinod M.
We propose a communication model, that we call compound arbitrarily varying channels (CAVC), which unifies and generalizes compound channels and arbitrarily varying channels (AVC). A CAVC can be viewed as a noisy channel with a fixed, but unknown, co
Externí odkaz:
http://arxiv.org/abs/2105.03420
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 channel where either user may deviate from the prescribed behaviour. O
Externí odkaz:
http://arxiv.org/abs/2105.03380
We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each, while a deco
Externí odkaz:
http://arxiv.org/abs/2102.12035