Sciweavers

554 search results - page 88 / 111
» Verifying Security Protocols Modelled by Networks of Automat...
Sort
View
179
Voted
JSC
2010
100views more  JSC 2010»
14 years 10 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
113
Voted
CORR
2007
Springer
138views Education» more  CORR 2007»
15 years 3 months ago
On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics
An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. U...
Sapon Tanachaiwiwat, Ahmed Helmy
137
Voted
WINET
2010
91views more  WINET 2010»
15 years 2 months ago
Route duration modeling for mobile ad-hoc networks
In this paper, we present a model that estimates the time duration of routes formed by several intermediate nodes in mobile multi-hop ad-hoc networks. First, we analyze a 3-node ro...
Michael Pascoe-Chalke, Javier Gomez, Victor Rangel...
144
Voted
CCS
2009
ACM
15 years 10 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
134
Voted
KBSE
2003
IEEE
15 years 9 months ago
A Programmable Client-Server Model: Robust Extensibility via DSLs
The client-server model has been successfully used to support a wide variety of families of services in the context of distributed systems. However, its server-centric nature make...
Charles Consel, Laurent Réveillère