Modeling vulnerabilities of ad hoc routing protocols

Authors:
Shahan Yang;John S. Baras
Affiliations:
University of Maryland College Park, College Park, MD;University of Maryland College Park, College Park, MD
Venue:
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
Year:
2003

Citing 9
Cited 11

Adequate proof principles for invariance and liveness properties of concurrent programs

Science of Computer Programming
Data networks

Data networks
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Strand spaces: proving security protocols correct

Journal of Computer Security
Athena: a novel approach to efficient automatic security protocol analysis

Journal of Computer Security
Securing ad hoc routing protocols

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Formal verification of standards for distance vector routing protocols

Journal of the ACM (JACM)
Fault-oriented Test Generation for Multicast Routing Protocol Design

FORTE XI / PSTV XVIII '98 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)
Formal analysis of routing protocols

Formal analysis of routing protocols

Towards provable security for ad hoc routing protocols

Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
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
Rule-based static analysis of network protocol implementations

Information and Computation
Secure neighbor discovery in wireless networks: formal investigation of possibility

Proceedings of the 2008 ACM symposium on Information, computer and communications security
Automated Evaluation of Secure Route Discovery in MANET Protocols

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Towards provable secure neighbor discovery in wireless networks

Proceedings of the 6th ACM workshop on Formal methods in security engineering
Let's Get Physical: Models and Methods for Real-World Security Protocols

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A correctness proof of the SRP protocal

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Formal Reasoning about Physical Properties of Security Protocols

ACM Transactions on Information and System Security (TISSEC)
Provable security of on-demand distance vector routing in wireless ad hoc networks

ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

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.