Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks
| Autor: | Hüttel, Hans, Kühnrich, Morten, Godskesen, Jens Christian |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: | |
| Zdroj: | Hüttel, H, Kühnrich, M & Godskesen, J C 2009, Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks . in Proceedings of the 7th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2008) . 229 edn, vol. 2, Elsevier, Electronic Notes in Theoretical Computer Science, no. 229, vol. 2, pp. 77-93, 7th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2008), Reykjavik, Iceland, 13/07/2008 . https://doi.org/doi:10.1016/j.entcs.2009.06.030 |
| DOI: | 10.1016/j.entcs.2009.06.030 |
| Popis: | We introduce a novel process calculus called DBSPI (distributed broadcast SPI-calculus) which models mobile ad hoc networks (MANET). The calculus is a cryptographic broadcast calculus with locations and migration. Communication and migration are limited to neighborhoods. Neighborhood definitions are explicitly part of the syntax allowing dynamic extension using bound identifiers. In this semantic setting we study authentication of agents in MANET protocols. A safety property dealing with authentication correspondence assertions is defined. Later a dependent type and effect system is given and it is shown to be sound, i.e. protocols which are typeable are also safe. This result is lifted to open systems which involves Dolev-Yao attackers. Our Dolev-Yao attacker may use public keys for encryption and can attack any neighborhood it wishes. Our technique is applied to the Mobile IP registration protocol – a type check shows it is safe. To our knowledge this is the first type system for a MANET calculus doing that. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|