Secret sharing schemes with partial broadcast channels
Designs, Codes and Cryptography
Efficient uncoordinated FHSS anti-jamming communication
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Anti-jamming broadcast communication using uncoordinated spread spectrum techniques
IEEE Journal on Selected Areas in Communications
Jamming-resistant broadcast communication without shared keys
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
Thwarting inside jamming attacks on wireless broadcast communications
Proceedings of the fourth ACM conference on Wireless network security
Investigation of signal and message manipulations on the wireless channel
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
| Hi-index | 0.00 |
In a traditional anti-jamming system a transmitter who wants to send a signal to a single sender spreads the signal power over a wide frequency spectrum with the aim of stopping a jammer from blocking the transmission. In this paper we consider the case that there are multiple receivers and the sender wants to broadcast a message to all receivers such that colluding groups of receivers cannot jam the reception of any other receiver. We propose efficient coding methods that achieve this goal and link this problem to well known problems in combinatorics. We also link a generalization of this problem to the Key Distribution Pattern problem studied in combinatorial cryptography.