MANETs and Sensor networks

News

Best viewed with a DHTML & CSS2 compatible browser in 1024x768 or higher.

Mobile ad hoc networks (MANETs) are collections of wireless mobile devices with restricted broadcast range and resources, and no infrastructure. Communication is achieved by relaying data along appropriate routes, that are dynamically discovered and maintained through collaboration between the nodes. Discovery of such routes is a major task, both from an efficiency and from a security point of view.

Recently, a security model tailored to the specific requirements of MANETs was introduced by Acs, Buttyan, and Vajda. Among the novel characteristics of this security model is that it promises security guarantees under concurrent executions, a feature of crucial practical implication for this type of distributed computation. A novel route discovery algorithm called endairA was also proposed, together with a claimed security proof within the same model. We analyze this algorithm and show that it is flawed, and vulnerable to a hidden channel attack. We also analyze the security framework used, and argue that composability is an essential feature for ubiquitous applications. We conclude by discussing some of the major security challenges for route discovery in MANETs.

Publications

Mike Burmester, Reihaneh Safavi-Naini and Gelareh Taban. 'Securing Random Key Predistribution Against Semi-Honest Adversaries'. Sixth International Conference on Networked Sensing Systems June 17 - 19, 2009, Carnegie Mellon University, Pittsburgh, USA
Mike Burmester and Breno de Medeiros. `On the Security of Route Discovery in MANETs'. ACM Transacions on Mobile Computing, 2009.
Mike Burmester and Breno de Medeiros. `Towards provable security for route discovery protocols in mobile ad hoc networks'. Cryptology ePrint Archive, 2007/324.
Mike Burmester, Emmanuel Magkos and Vassilis Chrissikopoulos. `Strengthening Privacy Protection in VANETs'. Proceedings, IEEE WiMob2008, International Workshop on Security and Privacy in Wireless and Mobile Computing, Networking and Communications (SecPriWiMob 2008), Avignon, France, October 12-14, 2008.
Mike Burmester, Reihaneh Safavi-Naini and Gelareh Taban. `Secure Random Key Pre-Distribution Against Semi-Honest Adversaries'. Cryptology ePrint Archive, Report 2008/446.
Mike Burmester, Tri van Le and Alec Yasinsac. `Adaptive gossip protocols: managing security and redundancy in dense ad hoc networks.' Journal of Ad hoc Networks, Elsevier, 4(3), pp. 504-515, 2006.
Mike Burmester, Tri van Le and Alec Yasinsac. `Weathering the storm: managing redundancy and security in ad hoc networks'. Proceedings of the 3rd International Conference on AD-HOC Networks & Wireless, Vancouver, British Columbia, pp. 96--107, July 22-24, 2004.
Mike Burmester and Tri van Le. `Secure Communication in Ad hoc Networks'. Proceedings of the IEEE Workshop on Information Assurance and Security', West Point, NY, pp. 234--241, June 2004.
Mike Burmester and Tri van Le. `Secure Multipath Communication in Mobile Ad hoc Networks'. International Conference on Information Technology: Coding and Computing (ITCC 2004), Las Vegas, April 5-7, 2004.
Mike Burmester Tri van Le and Matt Weir. `Tracing Byzantine faults in ad hoc networks'. Communication, Network and Information Security 2003, Dec 10-12 2003, New York, pp.43-46.