Detecting Byzantine Attacks for Gaussian Two-Way Relay System
Ruohan Cao

TL;DR
This paper proposes a detection scheme for Byzantine attacks in Gaussian two-way relay networks, demonstrating that such attacks are detectable under certain channel conditions without secret keys.
Contribution
It proves that the non-manipulable channel condition always holds in Gaussian two-way relay networks, enabling attack detection without secret keys.
Findings
Attack detection is possible if the channel is non-manipulable.
The non-manipulable condition always holds in Gaussian two-way relay channels.
The proposed method detects arbitrary attacks based solely on observations.
Abstract
This paper focuses on Byzantine attack detection for Gaussian two-way relay network. In this network, two source nodes communicate with each other with the help of an amplify-and-forward relay which may perform Byzantine attacks by forwarding altered symbols to the sources. For simple investigating the detectability of attacks conducted in Gaussian channels, we focus on the MA channel of the network, while assuming the BC channel is noiseless. Upon such model, we propose a attack detection scheme implemented in the sources. Specifically, we consider a open wireless propagation environment that allows the symbols, forwarded by the relay, to go through a continuous channel and arrive to the sources. With the observations of the source, we develop a detection scheme for the source by comparing the joint empirical distribution of its received and transmitted signals with the known channel…
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 · Privacy-Preserving Technologies in Data
