BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1133
DTSTAMP:20230914T125951Z
SUMMARY:Communication with Adversary Identification in Byzantine Multiple A
 ccess channels
DESCRIPTION:Speaker: Neha Sangwan\n\nAbstract: \nIn this talk\, I will intr
 oduce the problem of determining the identity of a byzantine user (interna
 l adversary) in a communication system. We will consider a two-user discre
 te memoryless multiple access channel where either user may deviate from t
 he prescribed behaviour. Owing to the noisy nature of the channel\, it may
  be overly restrictive to attempt to detect all deviations. In our formula
 tion\, we only require detecting deviations which impede the decoding of t
 he non-deviating user's message. When neither user deviates\, correct deco
 ding 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 corre
 ct or identify the deviating user. The users and the receiver do not share
  any randomness. The results include a characterization of the set of chan
 nels where communication is feasible\, and an inner and outer bound on the
 \ncapacity region.\nThe talk should be easy to follow for everyone\, inclu
 ding the first years.\nZoom link:\nhttps://zoom.us/j/93889521556?pwd=eEFJW
 VRtRHNpNlpZWmhNYTJGQTF6Zz09\n \n
URL:https://www.tcs.tifr.res.in/web/events/1133
DTSTART;TZID=Asia/Kolkata:20210604T171500
DTEND;TZID=Asia/Kolkata:20210604T181500
END:VEVENT
END:VCALENDAR