A clean slate approach to secure wireless networking

Foundations and Trends in Networking

Volumn 9, Issue 1, 2015, Pages 1-105

  Ponniah, Jonathan ^a   Hu, Yih Chun ^b   Kumar, P R ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; DESIGN; NETWORK PROTOCOLS; TELECOMMUNICATION NETWORKS; WIRELESS AD HOC NETWORKS;

CLEAN SLATES; DESIGN PROCESS; FUNDAMENTAL LIMITATIONS; MODEL ASSUMPTIONS; NASH EQUILIBRIA; SECURE PROTOCOLS; STRATEGIC ADVANTAGES; WIRELESS NETWORKING;

NETWORK SECURITY;

EID: 84940988433     PISSN: 1554057X     EISSN: 15540588     Source Type: Journal    
DOI: 10.1561/1300000037     Document Type: Article

References (44)

1. William J. Bolosky, John R. Douceur, David Ely, and Marvin Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs. In Proceedings of the 2000 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '00, pages 34-43, New York, NY, USA, 2000. ACM.
2. Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, OSDI '99, pages 173-186, Berkeley, CA, USA, 1999. USENIX Association.
3. David L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM, 24(2):84-90, February 1981.
4. S. Cheung. An efficient message authentication scheme for link state routing. In Computer Security Applications Conference, 1997. Proceedings., 13th Annual, pages 90-98, 1997.
5. Benny Chor, Eyal Kushilevitz, Oded Goldreich, and Madhu Sudan. Private information retrieval. J. ACM, 45(6):965-981, November 1998.
6. Yih chun Hu, Adrian Perrig, and David B. Johnson. Wormhole attacks in wireless networks. IEEE Journal on Selected Areas in Communications, 24:370-380, 2006.
7. Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In International Workshop on Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, pages 46-66, New York, NY, USA, 2001. Springer-Verlag New York, Inc.
8. Frank Dabek, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Wide-area cooperative storage with cfs. In Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, SOSP '01, pages 202-215, New York, NY, USA, 2001. ACM.
9. R. Dingledine, M.J. Freedman, and D. Molnar. The Free Haven Project: Distributed Anonymous Storage Service. Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, July 25-26, 2000: Proceedings, 2001.
10. Danny Dolev, Joe Halpern, and H. Raymond Strong. On the possibility and impossibility of achieving clock synchronization. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, STOC '84, pages 504-511, New York, NY, USA, 1984. ACM.
11. Rui Fan and Nancy Lynch. Gradient clock synchronization. Distrib. Comput., 18(4):255-266, March 2006.
12. Nikolaos M. Freris, Scott R. Graham, and P. R. Kumar. Fundamental limits on synchronizing clocks over networks. IEEE Trans. Automat. Contr., 56(6):1352-1364, 2011.
13. Yael Gertner, Shafi Goldwasser, and Tal Malkin. A random server model for private information retrieval or how to achieve information theoretic pir avoiding database replication. In Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM '98, pages 200-217, London, UK, UK, 1998. Springer-Verlag.
14. Andrew V. Goldberg and Peter N. Yianilos. Towards an archival intermemory. In ADL, pages 147-156. IEEE Computer Society, 1998.
15. J.H. Hartman, I. Murdock, and T. Spalink. The swarm scalable storage system. In Distributed Computing Systems, 1999. Proceedings. 19th IEEE International Conference on, pages 74-81, 1999.
16. R. Hauser, T. Przygienda, and G. Tsudik. Reducing the cost of security in link-state routing. In Network and Distributed System Security, 1997. Proceedings., 1997 Symposium on, pages 93-99, 1997.
17. A. Heffernan. Protection of bgp sessions via the tcp md5 signature option, 1998.
18. Yih-Chun Hu, David B. Johnson, and Adrian Perrig. Sead: secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks, 1:175-192, 2003.
19. Yih-Chun Hu, Adrian Perrig, and David B. Johnson. Rushing attacks and defense in wireless ad hoc network routing protocols. In Proceedings of the 2Nd ACM Workshop on Wireless Security, WiSe '03, pages 30-40, New York, NY, USA, 2003. ACM.
20. Yih-Chun Hu, Adrian Perrig, and David B. Johnson. Ariadne: A secure on-demand routing protocol for ad hoc networks. Wireless Networks, 11(1-2):21-38, January 2005.
21. Stephen Kent, Charles Lynn, Joanne Mikkelson, and Karen Seo. Secure border gateway protocol (s-bgp. IEEE Journal on Selected Areas in Communications, 18:103-116, 2000.
22. Fabian Kuhn, Christoph Lenzen, Thomas Locher, and Rotem Oshman. Optimal gradient clock synchronization in dynamic networks. In Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC '10, pages 430-439, New York, NY, USA, 2010. ACM.
23. Brijesh Kumar. Integration of security in network routing protocols. SIGSAC Rev., 11(2):18-25, April 1993.
24. Leslie Lamport and P. M. Melliar-Smith. Byzantine clock synchronization. In Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, PODC '84, pages 68-74, New York, NY, USA, 1984. ACM.
25. Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, July 1982.
26. Christoph Lenzen, Thomas Locher, and Roger Wattenhofer. Clock synchronization with bounded global and local skew. In Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS '08, pages 509-518, Washington, DC, USA, 2008. IEEE Computer Society.
27. Thomas Locher and Roger Wattenhofer. Oblivious gradient clock synchronization. In Proceedings of the 20th International Conference on Distributed Computing, DISC'06, pages 520-533, Berlin, Heidelberg, 2006. Springer-Verlag.
28. Jennifer Lundelius and Nancy A. Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2/3):190-204, August/September 1984.
29. Sergio Marti, T. J. Giuli, Kevin Lai, and Mary Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, MobiCom '00, pages 255-265, New York, NY, USA, 2000. ACM.
30. Radia Perlman. Interconnections: Bridges and Routers. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1992.
31. Adrian Perrig, Ran Canetti, J. D˜. Tygar, and Dawn Song. The tesla broadcast authentication protocol. RSA CryptoBytes, 5, 2002.
32. Adrian Perrig, Robert Szewczyk, J. D. Tygar, Victor Wen, and David E. Culler. Spins: Security protocols for sensor networks. Wirel. Netw., 8(5):521-534, September 2002.
33. Jonathan Ponniah, Yih-Chun Hu, and P. R. Kumar. A system-theoretic clean slate approach to provably secure ad hoc wireless networking. IEEE Transactions on Control of Network Systems, To appear.
34. Jonathan Ponniah, Yih-Chun Hu, and P.R. Kumar. An orthogonal multiple access coding scheme. Communications in Information and Systems, 12(1):41-76, 2012.
35. Michael K. Reiter and Aviel D. Rubin. Anonymous web transactions with crowds. Commun. ACM, 42(2):32-48, February 1999.
36. R.S. Robles, J.J. Haas, J.T. Chiang, Yih-Chun Hu, and P.R. Kumar. Secure topology discovery through network-wide clock synchronization. In Signal Processing and Communications (SPCOM), 2010 International Conference on, pages 1-5, July 2010.
37. Antony Rowstron and Peter Druschel. Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, SOSP '01, pages 188-201, New York, NY, USA, 2001. ACM.
38. K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, and E.M. Belding-Royer. A secure routing protocol for ad hoc networks. In Network Protocols, 2002. Proceedings. 10th IEEE International Conference on, pages 78-87, 2002.
39. B.R. Smith, S. Murthy, and J.J. Garcia-Luna-Aceves. Securing distance-vector routing protocols. In Network and Distributed System Security, 1997. Proceedings., 1997 Symposium on, pages 85-92, 1997.
40. Marc Waldman, Aviel D. Rubin, and Lorrie Faith Cranor. Publius: A robust, tamper-evident, censorship-resistant web publishing system. In Proceedings of the 9th Conference on USENIX Security Symposium - Volume 9, SSYM'00, pages 5-5, Berkeley, CA, USA, 2000. USENIX Association.
41. J.J. Wylie, M.W. Bigrigg, J.D. Strunk, G.R. Ganger, H. Kiliccote, and P.K. Khosla. Survivable information storage systems. Computer, 33(8):61-68, 2000.
42. Manel Guerrero Zapata. Secure ad hoc on-demand distance vector routing. SIGMOBILE Mob. Comput. Commun. Rev., 6(3):106-107, June 2002.
43. Kan Zhang. Efficient protocols for signing routing messages, 1998.
44. Lidong Zhou and Z.J. Haas. Securing ad hoc networks. Network, IEEE, 13(6):24-30, 1999.