|| Communication With Adversary Identification in Byzantine Multiple Access Channels
||Neha Sangwan, Tata Institute of Fundamental Research, India; Mayank Bakshi, Huawei, Hong Kong SAR of China; Bikash Kumar Dey, IIT Bombay, India; Vinod M. Prabhakaran, Tata Institute of Fundamental Research, India|
||D2-S3-T4: Information-Theoretic Security
||Tuesday, 13 July, 22:40 - 23:00
||Tuesday, 13 July, 23:00 - 23:20
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. Owing to the noisy nature of the channel, it may be overly restrictive to attempt to detect all deviations. In our formulation, we only require detecting deviations which impede the decoding of the non-deviating user's message. When neither user deviates, correct decoding is required. When one user deviates, the decoder must either output a pair of messages of which the message of the non-deviating user is correct or identify the deviating user. The users and the receiver do not share any randomness. The results include a characterization of the set of channels where communication is feasible, and an inner and outer bound on the capacity region.