Results 1  10
of
42
A Process Calculus for Mobile Ad Hoc Networks
"... Abstract. We present the ωcalculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The ωcalculus naturally captures essential characteristics of MANETs, including the ability of a MANET node to broadcast a message to any o ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present the ωcalculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The ωcalculus naturally captures essential characteristics of MANETs, including the ability of a MANET node to broadcast a message to any other node within its physical transmission range (and no others), and to move in and out of the transmission range of other nodes in the network. A key feature of the ωcalculus is the separation of a node’s communication and computational behavior, described by an ωprocess, from the description of its physical transmission range, referred to as an ωprocess interface. Our main technical results are as follows. We give a formal operational semantics of the ωcalculus in terms of labeled transition systems and show that the state reachability problem is decidable for finitecontrol ωprocesses. We also prove that the ωcalculus is a conservative extension of the πcalculus, and that late bisimulation (appropriately lifted from the πcalculus to the ωcalculus) is a congruence. Congruence results are also established for a weak version of late bisimulation, which abstracts away from two types of internal actions: τactions, as in the πcalculus, and µactions, signaling node movement. Finally, we illustrate the practical utility of the calculus by developing and analyzing a formal model of a leaderelection protocol for MANETs. 1
Towards a Calculus for Wireless Systems
"... In wireless systems, the communication mechanism combines features of broadcast, synchrony, and asynchrony. We develop an operational semantics for a calculus of wireless systems. We present a Reduction Semantics and a Labelled Transition Semantics and prove a correspondence result between them. W ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
(Show Context)
In wireless systems, the communication mechanism combines features of broadcast, synchrony, and asynchrony. We develop an operational semantics for a calculus of wireless systems. We present a Reduction Semantics and a Labelled Transition Semantics and prove a correspondence result between them. We first consider a core calculus, essentially with only the primitives for communication, and then a few extensions. A major goal of the semantics is to describe the forms of interferences among the activities of processes that are peculiar of wireless systems. Such interferences occur when a location is simultaneously reached by two transmissions.
Secure Neighbor Discovery in Wireless Networks: Formal Investigation of Possibility
 ACM SYMPOSIUM ON INFORMATION, COMPUTER AND COMMUNICATIONS SECURITY
, 2008
"... Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within direct radio communication, is a building block of network protocols and applications, and its vulnerability can severel ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
(Show Context)
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within direct radio communication, is a building block of network protocols and applications, and its vulnerability can severely compromise their functionalities. A number of proposals to secure ND have been published, but none have analyzed the problem formally. In this paper, we contribute such an analysis: We build a formal model capturing salient characteristics of wireless systems, most notably obstacles and interference, and we provide a specification of a basic variant of the ND problem. Then, we derive an impossibility result for a general class of protocols we term “timebased protocols,” to which many of the schemes in the literature belong. We also identify the conditions under which the impossibility result is lifted. Moreover, we explore a second class of protocols we term “time and locationbased protocols,” and prove they can secure ND.
Modeling and Verifying Ad Hoc Routing Protocols
, 2009
"... Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to find a route from one device to another. Those protocols use cryptographic mechanisms in order to prevent a malicious n ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
Mobile ad hoc networks consist of mobile wireless devices which autonomously organize their infrastructure. In such a network, a central issue, ensured by routing protocols, is to find a route from one device to another. Those protocols use cryptographic mechanisms in order to prevent a malicious node from compromising the discovered route. We present a calculus for modeling and reasoning about security protocols, including in particular secured routing protocols. Our calculus extends standard symbolic models to take into account the characteristics of routing protocols and to model wireless communication in a more accurate way. Then, by using constraint solving techniques, we propose a decision procedure for analyzing routing protocols for a bounded number of sessions and for a fixed network topology. We demonstrate the usage and usefulness of our approach by analyzing the protocol SRP applied to DSR.
Towards Provable Secure Neighbor Discovery in Wireless Networks
, 2008
"... In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant compromise of the dependent functionality of ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant compromise of the dependent functionality of wireless systems, numerous works proposed solutions to secure ND. Nonetheless, until very recently, there has been no formal analysis of secure ND protocols. We close this gap in [24], but we concentrate primarily on the derivation of an impossibility result for a class of protocols. In this paper, we focus on reasoning about specific protocols. First, we contribute a number of extensions and refinements on the framework of [24]. As we are particularly concerned with the practicality of provably secure ND protocols, we investigate availability and redefine accordingly the ND specification, and also consider composability of ND with other protocols. Then, we propose and analyze two secure ND protocols: We revisit one of the protocols analyzed in [24], and introduce and prove correct a more elaborate challengeresponse protocol.
Restricted broadcast process theory
 Proc. 6th Conference on Software Engineering and Formal Methods (SEFM’08
"... We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad hoc networks, i.e. local broadcast, connectivity of nodes and connectivity changes. Connectivity and connectivity changes a ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
(Show Context)
We present a process algebra for modeling and reasoning about Mobile Ad hoc Networks (MANETs) and their protocols. In our algebra we model the essential modeling concepts of ad hoc networks, i.e. local broadcast, connectivity of nodes and connectivity changes. Connectivity and connectivity changes are modeled implicitly in the semantics, which results in a more compact state space. Our connectivity model supports unidirectional links. A key feature of our algebra is eliminating connectivity information from the specification of a network, and transferring its complexity to the semantics. We give a formal operational semantics for our process algebra, and define equivalence relations on protocols and networks. We show how our algebra can be applied to prove correctness of an ad hoc routing protocol. 1.
W.L.: A process algebra for wireless mesh networks used for modelling, verifying and analysing AODV
"... Abstract. We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Adhoc OnDemand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedo ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Adhoc OnDemand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery. 1
Analysing routing protocols: four nodes topologies are sufficient
, 2011
"... Routing protocols aim at establishing a route between nodes on a network. Secured versions of routing protocols have been proposed in order to provide more guarantees on the resulting routes. Formal methods have proved their usefulness when analysing standard security protocols such as confidentiali ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Routing protocols aim at establishing a route between nodes on a network. Secured versions of routing protocols have been proposed in order to provide more guarantees on the resulting routes. Formal methods have proved their usefulness when analysing standard security protocols such as confidentiality or authentication protocols. However, existing results and tools do not apply to routing protocols. This is due in particular to the fact that all possible topologies (infinitely many) have to be considered. In this paper, we propose a simple reduction result: when looking for attacks on properties such as the validity of the route, it is sufficient to consider topologies with only four nodes, resulting in a number of just five distinct topologies to consider. As an application, we analyse the SRP applied to DSR and the SDMSR protocols using the ProVerif tool.
The Circal system, in
 Proc. 6th International Conference on Algebraic Methodologies and Software Technology (AMAST’97
, 1997
"... We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions. Based on a reduction semantics for the calculus we define a contextual equivalence to compare the external behaviour of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We present a timed process calculus for modelling wireless networks in which individual stations broadcast and receive messages; moreover the broadcasts are subject to collisions. Based on a reduction semantics for the calculus we define a contextual equivalence to compare the external behaviour of such wireless networks. Further, we construct an extensional LTS (labelled transition system) which models the activities of stations that can be directly observed by the external environment. Standard bisimulations in this LTS provide a sound proof method for proving systems contextually equivalence. We illustrate the usefulness of the proof methodology by a series of examples. Finally we show that this proof method is also complete, for a large class of systems. Supported by SFI project SFI 06 IN.1 1898.
Modeling and verifying physical properties of security protocols for wireless networks
 In Proc. 22nd Computer Security Foundations Symposium (CSF’09). IEEE Comp
, 2009
"... We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, tracebased, symbolic approaches with a formalization of physical properties of the environment, namely communication, location, and time. In particular, communication is subject ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, tracebased, symbolic approaches with a formalization of physical properties of the environment, namely communication, location, and time. In particular, communication is subject to physical constraints, for example, message transmission takes time determined by the communication medium used and the distance traveled. All agents, including intruders, are subject to these constraints and this results in a distributed intruder with restricted, but more realistic, communication capabilities than those of the standard DolevYao intruder. We have formalized our model in Isabelle/HOL and used it to verify protocols for authenticated ranging, distance bounding, and broadcast authentication based on delayed key disclosure. 1.