2018/05/08 by Jianhan Song, Qiaosheng Zhang, Song, Jianhan +7
Computer Science · Engineering · #FOS: Computer and information sciences #Information Theory (cs.IT) #Physical Unclonable Functions (PUFs) and Hardware Security #Security in Wireless Sensor Networks #Wireless Communication Security Techniques
paper · doi:10.48550/arxiv.1805.03095
openalex publication_date 2018/05/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We consider the problem of stealthy communication over a multipath network in the presence of an active adversary. The multipath network consists of multiple parallel noiseless links, and the adversary is able to eavesdrop and jam a subset of links. We consider two types of jamming---erasure jamming and overwrite jamming. We require the communication to be both stealthy and reliable, i.e., the adversary should be unable to detect whether or not meaningful communication is taking place, while the legitimate receiver should reconstruct any potential messages from the transmitter with high probability simultaneously. We provide inner bounds on the stealthy capacities under both adversarial erasure and adversarial overwrite jamming.