Modeling vulnerabilities of ad hoc routing protocols

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Modeling vulnerabilities of ad hoc routing protocols

Full text

Pdf (190 KB)

Source

Workshop on Security of ad hoc and Sensor Networks archive
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks table of contents

Fairfax, Virginia

SESSION: Ad hoc network table of contents

Pages: 12 - 20

Year of Publication: 2003

ISBN:1-58113-783-4

Authors

Shahan Yang	University of Maryland College Park, College Park, MD
John S. Baras	University of Maryland College Park, College Park, MD

Sponsor

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 38, Citation Count: 6

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/986858.986861 What is a DOI?

ABSTRACT

The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model fo protocol behavior is developed in which time is modeled by a set of constraints on the time of occurrence of events, enabling the representation of partially ordered timed events and asynchronous communication. Data variables are represented symbolically, capturing a range of distinct executions in each expression. Given a formal description of Ad Hoc On Demand Distance Vector Routing Algorithm (AODV) and a desired safety property (route stability), an analysis by a naive semi-decision procedure discovers an instance of an attack that leads to a violation of the property.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Dimitri Bertsekas , Robert Gallager, Data networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	2	Karthikeyan Bhargavan , Davor Obradovic , Carl A. Gunter, Formal verification of standards for distance vector routing protocols, Journal of the ACM (JACM), v.49 n.4, p.538-576, July 2002 [doi>10.1145/581771.581775]
	3	F. Javier Thayer Fábrega, Strand spaces: proving security protocols correct, Journal of Computer Security, v.7 n.2-3, p.191-230, Jan. 1999
	4	Ahmed Helmy , Deborah Estrin , Sandeep K. S. Gupta, Fault-oriented Test Generation for Multicast Routing Protocol Design, Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII), p.93-109, November 03-06, 1998
	5	Ahmed Helmy, Deborah Estrin, and Sandeep K. S. Gupta. Systematic testing of multicast routing protocols: Analysis of forward and backward search techniques. In Proceedings of IEEE ICCCN, October 2000.
	6	Gerard J. Holzmann, The Model Checker SPIN, IEEE Transactions on Software Engineering, v.23 n.5, p.279-295, May 1997 [doi>10.1109/32.588521]
	7	Zohar Manna , Amir Pnueli, Adequate proof principles for invariance and liveness properties of concurrent programs, Science of Computer Programming, v.4 n.3, p.257-289, Dec. 1984 [doi>10.1016/0167-6423(84)90003-0]
	8	Davor Obradovic , Carl A. Gunter, Formal analysis of routing protocols, 2001
	9	Adrian Perrig and Dawn Song. A first step towards the automatic generation of security protocols. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '00), pages 73--83, San Diego, CA, February 2000. Internet Society.
	10	Dawn Xiaodong Song , Sergey Berezin , Adrian Perrig, Athena: a novel approach to efficient automatic security protocol analysis, Journal of Computer Security, v.9 n.1-2, p.47-74, Jan. 1,2001
	11	Manel Guerrero Zapata , N. Asokan, Securing ad hoc routing protocols, Proceedings of the 3rd ACM workshop on Wireless security, p.1-10, September 28-28, 2002, Atlanta, GA, USA [doi>10.1145/570681.570682]

CITED BY 6

	Gergely Ács , Levente Buttyán , István Vajda, Modelling adversaries and security objectives for routing protocols in wireless sensor networks, Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks, October 30-30, 2006, Alexandria, Virginia, USA
	Gergely Acs , Levente Buttyan , Istvan Vajda, Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.5 n.11, p.1533-1546, November 2006
	Levente Buttyán , István Vajda, Towards provable security for ad hoc routing protocols, Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks, October 25-25, 2004, Washington DC, USA
	Octavian Udrea , Cristian Lumezanu , Jeffrey S. Foster, Rule-based static analysis of network protocol implementations, Information and Computation, v.206 n.2-4, p.130-157, February, 2008
	Marcin Poturalski , Panos Papadimitratos , Jean-Pierre Hubaux, Secure neighbor discovery in wireless networks: formal investigation of possibility, Proceedings of the 2008 ACM symposium on Information, computer and communications security, March 18-20, 2008, Tokyo, Japan
	Marcin Poturalski , Panos Papadimitratos , Jean-Pierre Hubaux, Towards provable secure neighbor discovery in wireless networks, Proceedings of the 6th ACM workshop on Formal methods in security engineering, p.31-42, October 27-27, 2008, Alexandria, Virginia, USA