Communications of the ACM
Introduction to Algorithms
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
Proceedings of the 3rd international conference on Mobile systems, applications, and services
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Applications of LDPC Codes to the Wiretap Channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The Wiretap Channel With Feedback: Encryption Over the Channel
IEEE Transactions on Information Theory
A Wireless Security Framework without Shared Secrets
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Using zero knowledge to share a little knowledge: bootstrapping trust in device networks
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
A shared-secret free security infrastructure for wireless networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Science of Computer Programming
| Hi-index | 0.00 |
We investigate the feasibility of achieving perfect secrecy in wireless network communications without shared secrets. We introduce a secure coding problem in which not only the sender but also the receiver participates in the coding. In essence, the receiver's role is to selectively jam the sender's transmission at the level of bits, bytes, or packets. We then design a class of secure codes, which we call dialog codes, for diverse channel models and receiver models. Our codes are simple and efficient, with only O(1) complexity in both the encoding and the decoding process, and achieve optimal coding rate in some channel models. This, along with their potential for augmenting security and/or simplifying security bootstrapping, makes them worthy of consideration for resource-constrained wireless sensor network devices. By way of experimental validation, we study the channel jamming characteristics of extant mote radios — specifically, CC2420 (IEEE 802.15.4) and CC1000— in experiments, observe their time-varying channel behavior, and demonstrate the correctness and robustness of implementations of our dialog codes at the byte-level and at the packet-level in the presence of dynamic channel fluctuations.