Secure communication over radio channels

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 105-114

  Dolev, Shlomi ^a   Gilbert, Seth ^b   Guerraoui, Rachid ^b   Newport, Calvin ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b EPFL   (Switzerland)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Malicious (byzantine) interference; Randomized algorithms; Wireless radio networks

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; RADIO COMMUNICATION; SECURE COMMUNICATION;

COMMUNICATION SERVICE; MALICIOUS ADVERSARIES; OPTIMAL RESILIENCE; RADIO CHANNELS; RADIO NETWORKS; RANDOMIZED ALGORITHMS; TRUSTED THIRD PARTIES; WIRELESS RADIO NETWORKS;

NETWORK SECURITY;

EID: 57549101228     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400767     Document Type: Conference Paper

References (23)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43(2):290-298, October 1992.
2. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-liop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System, Sciences, 45(1):104-126, 1992.
3. R. Bar-Yehuda. A. Israeli, and A. Itai. Multiple communication in multi-hop radio networks. SIAM Journal on Computing, 22(4):875-887, 1993.
4. V. Bhandari and N. H. Vaidya. On reliable broadcast in a radio network. In the Proceedings of the International Symposium, on Principles of Distributed Computing, pages 138-147, July 2005.
5. Bluetooth Consortium. Bluetooth Specification Version 2.1, July 2007.
6. M. Cagalj, S. Capkun, and J-P. Hubaux. Key agreement in peer-to-peer wireless networks. Proceedings of the IEEE (Special Issue on Cryptography and Security), 94(2), February 2006.
7. B. S. Chlebus, L. Gasieniec, A. Lingas, and A. T. Pagourtzis. Oblivious gossiping in ad-hoc radio networks. In the Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 44-51, 2001.
8. B. S. Chlebus and D. R. Kowalski. Robust gossiping with an application to consensus. Journal of Computer and System Sciences, 72(8):1262-1281, December 2006.
9. A. Clementi, A. Monti, and R. Silvestri. Optimal f-reliable protocols for the do-all problem on single-hop wireless networks. Algorithms and Computation, pages 320-331, 2002.
10. A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel and Distributed Computing, 64(1):89-96, 2004.
11. Artur Czumaj and Wojciech Rytter. Broadcasting algorithms in radio networks with unknown topology. In the Proceedings of the Symposium on Foundations of Computer Science, October 2003.
12. W. Diffe and M. Hellman. New directions in cyptography. Transactions on Information Theory, November 1976.
13. S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport. Gossiping in a multi-channel radio network: An oblivious approach to coping with malicious interference. In the Proceedings of the International Symposium on Distributed Computing, September 2007.
14. S. Gilbert, R. Guerraoui, and C. Newport. Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In the Proceedings of the International Conference on Principles of Distributed Systems, December 2006.
15. J. Komlos and A. G. Greenberg. An asymptotically fast non-adaptive algorithm for conflict resolution in multiple access channels. IEEE Transactions of Information Theory, 31(2,) March 1985.
16. C.-Y. Koo. Broadcast in radio networks tolerating byzantine adversarial behavior. In the Proceedings of the International Symposium on Principles of Distributed Computing, pages 275-282, July 2004.
17. C-Y. Koo, V. Bhandari, J. Katz, and N. H. Vaidya. Reliable broadcast in radio networks: The bounded collision case. In the Proceedings of the International Symposium on Principles of Distributed Computing, July 2006.
18. D. Kowalski and A. Pelc. Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing, 33(4):870-891, 2004.
19. E. Kranakis, D. Krizanc, and A. Pelc. Fault-tolerant broadcasting in radio networks. Journal of Algorithms, 39(1):47-67, April 2001.
20. E. Kushelevitz and Y. Mansour. An Ω(dlog(n/d)) lower bound for broadcast in radio networks. In the Proceedings of the International Symposium on Principles of Distributed Computing, August 1993.
21. A. Pelc and D. Peleg. Feasibility and complexity of broadcasting with random transmission failures. In the Proceedings of the International Symposium on Principles of Distributed Computing, pages 334-341, July 2005.
22. F. Stajano and R. Anderson. The resurrecting duckling: security issues for ad hoc wireless networks. In the Proceedings of the International Workshop on Security Protocols, April 1999.
23. D. E. Willard. Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal of Computing, 15(2):468-477, 1986.