Neha Sangwan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Neha Sangwan has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Bikash Kumar Dey
Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India
3 shared publications - Mayank Bakshi
School of Electrical, Computer and Energy Engineering, Arizona State University, Tempe, AZ, USA
3 shared publications - Vinod M. Prabhakaran
School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India
3 shared publications - Eeshan Modak
School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India
1 shared publication - Ezgi Ozyilkan
Department of Electrical and Computer Engineering, New York University, Brooklyn, NY, USA
1 shared publication - Farhad Shirani
Knight Foundation School of Computing and Information Sciences, Florida International University, Miami, FL, USA
1 shared publication
Latest Publications
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 5104-5121
Hypothesis Testing for Adversarial Channels: Chernoff–Stein Exponents
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (7) , 5104-5121
Hypothesis Testing for Adversarial Channels: Chernoff–Stein Exponents
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (3) , 1874-1899
Consensus Capacity of Noisy Broadcast Channels
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 which permit this Byzantine consensus and determine their capacity. We show that communication with consensus is possible only when the broadcast channel has embedded in it a natural “common channel” whose output both receivers can unambiguously determine from their own channel outputs. Interestingly, in general, the consensus capacity may be larger than the point-to-point capacity of the common channel, i.e., while decoding, the receivers may make use of parts of their output signals on which they may not have consensus provided there are some parts (namely, the common channel output) on which they can agree.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (3) , 1874-1899
Consensus Capacity of Noisy Broadcast Channels
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 which permit this Byzantine consensus and determine their capacity. We show that communication with consensus is possible only when the broadcast channel has embedded in it a natural “common channel” whose output both receivers can unambiguously determine from their own channel outputs. Interestingly, in general, the consensus capacity may be larger than the point-to-point capacity of the common channel, i.e., while decoding, the receivers may make use of parts of their output signals on which they may not have consensus provided there are some parts (namely, the common channel output) on which they can agree.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE BITS the Information Theory Magazine
- Vol. 4 (2) , 39-42
Unconference on Generative AI and LLMs Session At ISIT 2023 and ISIT 2024
In an era marked by the rapid and transformative rise of generative AI, professionals, researchers, and students alike are compelled to engage in meaningful discussions with their peers to navigate the profound changes and opportunities this technology brings. Reflecting this shared sentiment, the inaugural unconference event on Generative AI and Large Language Models (LLMs) was held at ISIT 2023, followed by its second edition in 2024. Key discussions covered the integration of AI into academic tasks, its transformative effects on education, its influence on research methodologies, and career implications. Reflective conversations highlighted ethical concerns and the evolving academic landscape that accompanies them. The unconference format, characterized by a lack of a strict structure, encouraged participants to engage in free-flowing discussions and share their insights openly. This year's unconference event at ISIT 2024 concluded with a call to action for participants to contribute to the ethical and effective use of generative AI.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE BITS the Information Theory Magazine
- Vol. 4 (2) , 39-42
Unconference on Generative AI and LLMs Session At ISIT 2023 and ISIT 2024
In an era marked by the rapid and transformative rise of generative AI, professionals, researchers, and students alike are compelled to engage in meaningful discussions with their peers to navigate the profound changes and opportunities this technology brings. Reflecting this shared sentiment, the inaugural unconference event on Generative AI and Large Language Models (LLMs) was held at ISIT 2023, followed by its second edition in 2024. Key discussions covered the integration of AI into academic tasks, its transformative effects on education, its influence on research methodologies, and career implications. Reflective conversations highlighted ethical concerns and the evolving academic landscape that accompanies them. The unconference format, characterized by a lack of a strict structure, encouraged participants to engage in free-flowing discussions and share their insights openly. This year's unconference event at ISIT 2024 concluded with a call to action for participants to contribute to the ethical and effective use of generative AI.
- 27 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (1) , 23-60
Byzantine Multiple Access Channels—Part II: Communication With Adversary Identification
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. Since small deviations may be indistinguishable from the effects of channel noise, it might 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. We also show that whenever the rate region has non-empty interior, the capacity region is same as the capacity region under randomized encoding, where each user shares independent randomness with the receiver. We also give an outer bound for this randomized coding capacity region.
- 27 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (1) , 23-60
Byzantine Multiple Access Channels—Part II: Communication With Adversary Identification
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. Since small deviations may be indistinguishable from the effects of channel noise, it might 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. We also show that whenever the rate region has non-empty interior, the capacity region is same as the capacity region under randomized encoding, where each user shares independent randomness with the receiver. We also give an outer bound for this randomized coding capacity region.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (4) , 2309-2366
Byzantine Multiple Access Channels—Part I: Reliable Communication
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 reliably. When a user behaves adversarially, we require that the honest users’ messages be decoded reliably. An adversarial user can mount an attack by sending any input into the channel rather than following the protocol. It turns out that the 2-user MAC capacity region follows from the point-to-point Arbitrarily Varying Channel (AVC) capacity. For the 3-user MAC in which at most one user may be malicious, we characterize the capacity region for deterministic codes and randomized codes (where each user shares an independent random secret key with the receiver). These results are then generalized for the k -user MAC where the adversary may control all users in one out of a collection of given subsets.
- 12 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (4) , 2309-2366
Byzantine Multiple Access Channels—Part I: Reliable Communication
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 reliably. When a user behaves adversarially, we require that the honest users’ messages be decoded reliably. An adversarial user can mount an attack by sending any input into the channel rather than following the protocol. It turns out that the 2-user MAC capacity region follows from the point-to-point Arbitrarily Varying Channel (AVC) capacity. For the 3-user MAC in which at most one user may be malicious, we characterize the capacity region for deterministic codes and randomized codes (where each user shares an independent random secret key with the receiver). These results are then generalized for the k -user MAC where the adversary may control all users in one out of a collection of given subsets.