Abstract
Secure bootstrapping of mobile ad hoc networks (MANETs) is a challenging problem in scenarios in which network users (or nodes) do not share trust relationships prior to the network deployment. In recent years, a number of schemes have been proposed to solve this problem, assuming either no or limited trust between the nodes prior to their deployment. Despite numerous proposals, there is no common understanding of the proposed schemes and of the trade-offs that they provide. This has consequences for both researchers and practitioners, who do not have a clear idea how to compare the schemes and how to select a scheme for a given application. In this article, we present a framework that helps in understanding and comparing schemes for secure bootstrapping of MANETs. The framework is general because it is policy-neutral and can accommodate many existing bootstrapping schemes. The proposed framework can equally serve as a good basis for the development of new MANET bootstrapping schemes; we show how the development of the framework leads to two new (classes of) distributed bootstrapping schemes. Within the framework, we not only investigate and characterize the properties of the relevant bootstrapping schemes, but also give methods for practitioners to select the relevant system parameters in the Random Walk and the (Restricted) Random Waypoint mobility models.
- Aldous, D. J. and Fill, A. 2000. Markov chains on graphs. Manuscript under preparation.Google Scholar
- Anderson, R. and Kuhn, M. 1996. Tamper resistance - a cautionary note. In Proceedings of The 2nd USENIX Workshop on Electronic Commerce. The USENIX Association, Oakland, CA, 1--11. Google Scholar
Digital Library
- Asokan, N. and Ginzboorg, P. 2000. Key management in ad hoc networks. Comput. Comm., 23, 1627--1637. Google Scholar
Digital Library
- Balfanz, D., Smetters, D., Stewart, P., and Wong, H. 2002. Talking to strangers: Authentication in ad-hoc wireless networks. In Proceedings of the Network and Distributed Systems Security Symposium (NDSS'02). The Internet Society, San Diego, CA.Google Scholar
- Basagni, S., Herrin, K., Bruschi, D., and Rosti, E. 2001. Secure pebblenets. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'01). ACM Press, 156--163. Google Scholar
Digital Library
- Bechler, M., Hof, H., Kraft, D., Pahlke, F., and Wolf, L. 2004. A cluster-based security architecture for ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04).Google Scholar
- Bellare, M. and Rogaway, P. 1996. The exact security of digital signatures - how to sign with rsa and rabin. In Proceedings of the International Conference on the Theory and Application of Crytographic Techniques (EUROCRYPT'96). 399--416. Google Scholar
Digital Library
- Blom, R. 1984. An optimal class of symmetric key generation systems. In Proceedings of the International Conference on the Theory and Application of Crytographic Techniques (EUROCRYPT'84). 335--338. Google Scholar
Digital Library
- Blundo, C., DeSantis, A., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1992. Perfectly-secure key distribution for dynamic conferences. In Proceedings of the Annual International Cryptology Conference (CRYPTO'92), E. F. Brickell, Ed. Springer-Verlag, 471--486. Lecture Notes in Computer Science No. 740. Google Scholar
Digital Library
- Brands, S. and Chaum, D. 1994. Distance-bounding protocols. In Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques on Advances in Cryptology (EUROCRYPT'94). Springer-Verlag New York, Inc., 344--359. Google Scholar
Digital Library
- Čagalj, M. and Hubaux, J. P. 2004. Key agreement over a radio link. Tech. Rep. IC/2004/16, EPFL-DI-ICA. January.Google Scholar
- Čagalj, M., Čapkun, S., and Hubaux, J.-P. 2006. Key agreement in peer-to-peer wireless networks. Proceedings of the IEEE, to appear.Google Scholar
- Camp, T., Boleng, J., and Davies, V. 2002. A survey of mobility models for ad hoc network research. Wireless Communications and Mobile Computing: Special Issue on Mobile Ad Hoc Networking: Research, Trends and Applications, 2, 5, 483--502.Google Scholar
- Camtepe, S. and Yener, B. 2004. Combinatorial design of key distribution mechanisms for wireless sensor networks. In Proceedings of the 9th European Symposium on Research Computer Security (ESORICS'04). Lecture Notes in Computer Science, vol. 3193. 293--308.Google Scholar
Cross Ref
- Capkun, S., Buttyan, L., and Hubaux, J. 2003. Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing, 2, 1, 52--64. Google Scholar
Digital Library
- Capkun, S., Hubaux, J., and Buttyan, L. 2003. Mobility helps security in ad hoc networks. In Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03). ACM Press, 46--56. Google Scholar
Digital Library
- Chan, A. 2004. Distributed symmetric key management for mobile ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04).Google Scholar
Cross Ref
- Chan, H. and Perrig, A. 2005. Pike: Peer intermediaries for key establishment in sensor networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05).Google Scholar
- Chan, H., Perrig, A., and Song, D. 2003. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy 2003 (SP'03). IEEE Computer Society, 197--214. Google Scholar
Digital Library
- Douceur, J. 2002. The sybil attack. In Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'01). Springer-Verlag, London, UK, 251--260. Google Scholar
Digital Library
- Du, W., Deng, J., Han, Y., and Varshney, P. 2003. A pairwise key pre-distribution scheme for wireless sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). ACM, 42--51. Google Scholar
Digital Library
- Ellis, R. Torus Hitting Times Project. http://www.math.tamu.edu/~rellis/comb/torus/torus.html.Google Scholar
- Eschenauer, L. and Gligor, V. 2002. A key-management scheme for distributed sensor networks. In Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS'02). 41--47. Google Scholar
Digital Library
- Goldwasser, S., Micali, S., and Rivest, R. 1988. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17, 2 (Apr.), 281--308. Google Scholar
Digital Library
- Goodrich, M., Sirivianos, M., Solis, J., Tsudik, G., and Uzun, E. 2006. Loud and clear: Human-verifiable authentication based on audio. In Proceedings of IEEE International Conference on Distributed Computing Systems (ICDCS'06). Google Scholar
Digital Library
- Grossglauser, M. and Tse, D. 2002. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. Netw., 10, 4, 477--486. Google Scholar
Digital Library
- Grossglauser, M. and Vetterli, M. 2003. Locating nodes with ease: Mobility diffusion of last encounters in ad hoc networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'03).Google Scholar
- Hoepman, J. 2004. The ephemeral pairing problem. In Proceedings of Financial Cryptography (FC'04). Lecture Notes in Computer Science, vol. 3110. 212--226.Google Scholar
Cross Ref
- Hu, Y.-C., Perrig, A., and Johnson, D. B. 2002. Ariadne: a secure on-demand routing protocol for ad hoc networks. In Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM'02). ACM Press, 12--23. Google Scholar
Digital Library
- Hubaux, J., Buttyan, L., and Capkun, S. 2001. The quest for security in mobile ad hoc networks. In Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC'01). ACM Press, 146--155. Google Scholar
Digital Library
- Kong, J., Zerfos, P., Luo, H., Lu, S., and Zhang, L. 2001. Providing robust and ubiquitous security support for mobile ad hoc networks. In 9th International Conference on Network Protocols (ICNP'01). IEEE Computer Society, 251--260. Google Scholar
Digital Library
- Krawczyk, H. 2003. Sigma: The “sign-and-mac” approach to authenticated Diffie-Hellman and its use in the ike-protocols. In Proceedings of the Annual International Cryptology Conference (CRYPTO'03). Lecture Notes in Computer Science, vol. 2729. 400--425.Google Scholar
Cross Ref
- Lee, J. and Stinson, D. 2004. Deterministic key predistribution schemes for distributed sensor networks. In Proceedings of the 11th International Workshop Selected Areas in Cryptography (SAC'04). Lecture Notes in Computer Science, vol. 3357. 294--307. Google Scholar
Digital Library
- Liu, D. and Ning, P. 2003. Establishing pairwise keys in distributed sensor networks. In Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS'03). ACM, 52--61. Google Scholar
Digital Library
- McCune, J., Perrig, A., and Reiter, M. 2005. Seeing-is-believing: Using camera phones for human-verifiable authentication. In IEEE Symposium on Security and Privacy (SP'05). 110--124. Google Scholar
Digital Library
- Narasimha, M., Tsudik, G., and Yi, J. 2003. On the utility of distributed cryptography in p2p and manets: The case of membership control. In 11th IEEE International Conference on Network Protocols (ICNP'03). 336--345. Google Scholar
Digital Library
- Needham, R. M. and Schroeder, M. D. 1978. Using encryption for authentication in large networks of computers. Comm. ACM, 21, 12 (Dec.), 993--999. Google Scholar
Digital Library
- Ostrovsky, R. and Yung, M. 1991. How to withstand mobile virus attacks (extended abstract). In Proceedings of the 10th Annual ACM Symposium on Princiles of Distributed Computing (PODC'91). 51--59. Google Scholar
Digital Library
- Papadimitratos, P. and Haas, Z. J. 2002. Secure routing for mobile ad hoc networks. In Proceedings of the Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS'02).Google Scholar
- Papadimitratos, P. and Haas, Z. J. 2003. Secure data transmission in mobile ad hoc networks. In Proceedings of the ACM Workshop on Wireless Security (WiSe'03). ACM Press, 41--50. Google Scholar
Digital Library
- Johnson, D. B. 1994. Routing in Ad Hoc Networks of Mobile Hosts. In Proceedings of the IEEE Workshop on Mobile Computing Systems and Applications (WMCSA'94). Google Scholar
Digital Library
- Doyle, P. G. and Snell, J. L. 2001. Random walks and electric networks. Number 22. Carus Mathematical Monographs.Google Scholar
- Shah, R. C., Roy, S., Jain, S., and Brunette, W. 2003. Data MULEs: Modeling a three-tier architecture for sparse sensor networks. In Proceedings of the IEEE Workshop on Sensor Network Protocols and Applications (SNPA'03).Google Scholar
- Rivest, R., Shamir, A., and Adleman, L. 1978. A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM, 21, 2, 120--126. Google Scholar
Digital Library
- Saxena, N. 2006. Public key cryptography sans certificates in ad hoc networks. In Proceedings of the 4th International Conference Applied Cryptography and Network Security (ACNS'06). Lecture Notes in Computer Science, vol. 3989. 375--389. Google Scholar
Digital Library
- Saxena, N., Tsudik, G., and Yi, J. 2005. Efficient node admission for short-lived mobile ad hoc networks. In Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP'05). 269--278. Google Scholar
Digital Library
- Stajano, F. and Anderson, R. 1999. The resurrecting duckling: Security issues for ad-hoc wireless networks. In Proceedings of the 7th International Workshop on Security Protocols. Google Scholar
Digital Library
- TCG. Trusted computing group (tcg) specifications. https://www.trustedcomputinggroup.org/home.Google Scholar
- Vaudenay, S. 2005. Secure communications over insecure channels based on short authenticated strings. In Advances in Cryptology---Crypto'05. Springer-Verlag, Berlin, 309--326. Lecture Notes in Computer Science No. 3621. Google Scholar
Digital Library
- Wu, J. and Wei, R. 2005. Comments on “distributed symmetric key management for mobile ad hoc networks” from infocom 2004. Cryptology ePrint Archive, Report 2005/008. Available at http://eprint.iacr.org/.Google Scholar
- Xu, G. and Iftode, L. 2004. Locality driven key management architecture for mobile ad hoc networks. In Proceedings of the IEEE Conference on Mobile Ad Hoc and Sensor Systems (MOBIHOC'04). 436--446.Google Scholar
- Yi, S. and Kravets, R. 2003. Moca: Mobile certificate authority for wireless ad hoc networks. In The 2nd Annual PKI Research Workshop (PKI'03).Google Scholar
- Yoon, J., Liu, M., and Noble, B. 2003. Random Waypoint Considered Harmful. In Proceedings of the IEEE Conference on Computer Communications (InfoCom'03). San Francisco.Google Scholar
- Zhou, L. and Haas, Z. 1999. Securing ad hoc networks. IEEE Networks, 13, 6, 24--30. Google Scholar
Digital Library
- Zhu, S., Xu, S., Setia, S., and Jajodia, S. 2003. Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach. In 11th IEEE International Conference on Network Protocols (ICNP'03). 326--335. Google Scholar
Digital Library
Index Terms
Distributed and Secure Bootstrapping of Mobile Ad Hoc Networks: Framework and Constructions
Recommendations
Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks
LCN '07: Proceedings of the 32nd IEEE Conference on Local Computer NetworksConventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, where a mobile node blindly rebroadcasts received Route Request (RREQ) packets until a route to a particular destination is established. This can ...
Performance Evaluation of Routing Protocols in Mobile Ad-Hoc Networks with Varying Node Density and Node Mobility
CSNT '13: Proceedings of the 2013 International Conference on Communication Systems and Network TechnologiesMobile Ad-hoc Network (MANET) is a collection of mobile nodes which can self-organize freely and dynamically into arbitrary and temporary network topologies. Mobile nodes in ad-hoc networks can dynamically establish routes among themselves by means of a ...
An Adjusted Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks
UKSIM '08: Proceedings of the Tenth International Conference on Computer Modeling and SimulationBroadcasting is a fundamental and frequently usedoperation in mobile ad hoc networks (MANETs) wherea source node diffuses a message to all other nodes inthe networks. Flooding, the process in which eachnode retransmits every uniquely received ...






Comments