Sciweavers

37 search results - page 3 / 8
» How to Specify and How to Prove Correctness of Secure Routin...
Sort
View
PADL
2001
Springer
13 years 9 months ago
Specifying Authentication Protocols Using Rewriting and Strategies
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
Horatiu Cirstea
JACM
2002
163views more  JACM 2002»
13 years 5 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
ADHOC
2007
144views more  ADHOC 2007»
13 years 5 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
GLOBECOM
2009
IEEE
14 years 5 days ago
PreDA: Predicate Routing for DTN Architectures over MANET
—We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level...
Flavio Esposito, Ibrahim Matta
COMCOM
2000
97views more  COMCOM 2000»
13 years 5 months ago
Verification of security protocols using LOTOS-method and application
We explain how the formal language LOTOS can be used to specify security protocols and cryptographic operations. We describe how security properties can be modelled as safety prop...
Guy Leduc, François Germeau