Byzantine Multiple Access
Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran

TL;DR
This paper investigates reliable and authenticated communication over multiple access channels with potential adversarial users, characterizing capacity regions and proposing optimal schemes for both scenarios.
Contribution
It provides the first capacity region characterization for randomized and deterministic codes in adversarial MACs, and introduces a rate-optimal authentication scheme with minimal overhead.
Findings
Capacity region characterized for randomized codes.
Deterministic codes achieve capacity when non-symmetrizable.
Authenticated capacity is either zero or equals the MAC capacity.
Abstract
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 reliably. When an adversary is present, we consider two different decoding guarantees. In part I, we require that the honest users' messages be decoded reliably. We study the 3-user MAC; 2-user MAC capacity follows from point-to-point AVC capacity. We characterize the capacity region for randomized codes. We also study the capacity region for deterministic codes. We obtain necessary conditions including a new non-symmetrizability condition for the capacity region to be non-trivial. We show that when none of the users are symmetrizable, the randomized coding capacity region is also achievable with deterministic codes. In part II, we consider the weaker goal of authenticated communication where we only…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Cellular Automata and Applications
