Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
Multiple communication im multihop radio networks
SIAM Journal on Computing
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of Computer and System Sciences
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks
Proceedings of the 7th International Workshop on Security Protocols
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Self-stabilizing and self-orgenizing mobile networks
Proceedings of the fifth international workshop on Foundations of mobile computing
Efficient uncoordinated FHSS anti-jamming communication
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Towards Fair Leader Election in Wireless Networks
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Securing every bit: authenticated broadcast in radio networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Anti-jamming broadcast communication using uncoordinated spread spectrum techniques
IEEE Journal on Selected Areas in Communications
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Trusted computing for fault-prone wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Conflict on a communication channel
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Secure and self-stabilizing clock synchronization in sensor networks
Theoretical Computer Science
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
DISC'11 Proceedings of the 25th international conference on Distributed computing
Deterministic multi-channel information exchange
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Making evildoers pay: resource-competitive broadcast in sensor networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Leader election in shared spectrum radio networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Monitoring churn in wireless networks
Theoretical Computer Science
Countermeasures against sybil attacks in WSN based on proofs-of-work
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study the problem of secure communication in a multi-channel, single-hop radio network with a malicious adversary that can cause collisions and spoof messages. We assume no pre-shared secrets or trusted-third-party infrastructure. The main contribution of this paper is f-AME: a randomized (f)ast-(A)uthenticated (M)essage (E)xchange protocol that enables nodes to exchange messages in a reliable and authenticated manner. It runs in O(|E|t2 log n) time and has optimal resilience to disruption, where E is the set of pairs of nodes that need to swap messages, n is the total number of nodes, C the number of channels, and t 3 log n) rounds for the setup phase, and O(t log n) rounds for an arbitrary pair to communicate. By contrast, existing solutions rely on pre-shared secrets, trusted third-party infrastructure, and/or the assumption that all interference is non-malicious.