Affiliation:
1. IBM T.J. Watson Research Center, USA
2. Roke Manor Research Ltd, UK
Abstract
Designing a coalition network for chaotic environments (e.g., responding to a large catastrophe) is challenging because such systems cannot rely on availability of a fixed communication or a security infrastructure. In such situations, a coalition may use Mobile Ad-hoc NETworks (MANETs) to communicate and to extend its operational reach and tempo. In this scenario, bootstrapping security and networking protocols requires that networking protocols cannot assume full existence of operational security protocols and vice-versa. In this chapter, the authors outline a realistic bounded resource adversary model and examine bootstrapping problems in the physical & link layer and the routing layer with the goal of identifying new research challenges and novel solution methodologies. In particular, (i) the authors examine secure link key set up protocols at the physical & link layer that neither use computationally intensive PKI mechanisms nor assume pre-configured shared keys between nodes that belong to different coalition partners, (ii) identify new security issues owing to power saving intra-domain routing protocols that use sophisticated packet matching and forwarding mechanisms; in a coalition setting they also examine inter-domain routing protocols that preserve domain autonomy and yet permits scalable network monitoring and misbehavior detection, (iii) examine identity management issues in MANETs and outline a wireless fingerprinting approach to condone a malicious node from spoofing and forging one or more identities on the network.
Reference57 articles.
1. Alaettinoglu, C., Villamizar, C., Gerich, E., Kessens, D., Meyer, D., Bates, T., Karrenberg, D. & Terpstra, M. (1999). Routing Policy Specification Language (RPSL). RFC 2622 (Proposed Standard), June 1999. Updated by RFC 4012.
2. Barbir, A., Murphy, S. & Yang, Y. (2006, October). Generic Threats to Routing Protocols. RFC 4593 (Informational).
3. Barros, J. H., & Rodrigues, M. R. D. (2006). Secrecy Capacity of Wireless Channels. In IEEE International Symposium on the Information Theory.
4. Benaloh, J. (1999). Dense Probabilistic Encryption. Retrieved from http://research.microsoft.com/crypto/papers/dpe.ps
5. BoldyrevaA.GentryC.O’NeillA.YumD. H. (2007). Ordered multi-signatures and identity-based sequential aggregate signatures, with applications to secure routing. In 14th ACM conference on Computer and communications security (pp. 276–285). New York.