The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January-March (2003 vol.2)
pp: 52-64
ABSTRACT
<p><b>Abstract</b>—In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. In this paper, we propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.</p>
INDEX TERMS
Mobile ad hoc networks, self-organization, security, key authentication, public-key cryptography, PGP.
CITATION
Srdjan Capkun, Levente Buttyán, Jean-Pierre Hubaux, "Self-Organized Public-Key Management for Mobile Ad Hoc Networks", IEEE Transactions on Mobile Computing, vol.2, no. 1, pp. 52-64, January-March 2003, doi:10.1109/TMC.2003.1195151
REFERENCES
[1] C.E. Perkins, Ad Hoc Networking. Addison Wesley Professional, Dec. 2000.
[2] D.B. Johnson, “Routing in Ad Hoc Networks of Mobile Hosts,” Proc. Workshop Mobile Computing and Applications, 1994.
[3] J. Jubin and J.D. Turnow, “The DARPA Packet Radio Project” Proc. IEEE, 1987.
[4] L.M. Kornfelder, “Toward a Practical Public-Key Cryptosystem,” bachelor's thesis, Dept. Electrical Eng., Massachusetts Inst. of Technology, Cambridge, 1978.
[5] P. Zimmerman, The Official PGP User's Guide. MIT Press, 1995.
[6] L. Zhou and Z. Haas, “Securing Ad Hoc Networks,” IEEE Network, vol. 13, no. 6, pp. 24-30, Nov./Dec. 1999.
[7] J. Kong, P. Zerfos, H. Luo, S. Lu, and L. Zhang, “Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks,” Proc. Ninth Int'l Conf. Network Protocols (ICNP), Nov. 2001.
[8] J. Douceur, “The Sybil Attack,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[9] G. Montenegro and C. Castelluccia, “Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Addresses,” Proc. Ninth Ann. Network and Distributed System Security Symp. (NDSS), 2002.
[10] G. O'Shea and M. Roe, “Child-Proof Authentication for MIPv6 (CAM),” ACM Computer Comm. Rev., Apr. 2001.
[11] J.-P. Hubaux, T. Gross, J.-Y. Le Boudec, and M. Vetterli, “Toward Self-Organized Mobile Ad Hoc Networks: The Terminodes Project,” IEEE Comm. Magazine, Jan. 2001.
[12] L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J.-P. Hubaux, and J.-Y. Le Boudec, “Self-Organization in Mobile Ad Hoc Networks: The Approach of Terminodes,” IEEE Comm. Magazine, June 2001.
[13] J.-P. Hubaux, L. Buttyan, and S. Capkun, “The Quest for Security in Mobile Ad Hoc Networks,” Proc. ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), 2001.
[14] S. Capkun, L. Buttyan, and J.-P. Hubaux, “Small Worlds in Security Systems: an Analysis of the PGP Certificate Graph,” Proc. ACM New Security Paradigm Workshop (NSPW), 2002.
[15] L. Buttyan and J.-P. Hubaux, “Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks,” to appear in ACM/Kluwer Mobile Networks and Applications (MONET), vol. 8, no. 5, Oct. 2003.
[16] F. Stajano and R. Anderson, "The Resurrecting Duckling: Security Issues for Ad Hoc Wireless Networks," Security Protocols, > Lecture Notes in Computer Science, vol. 1796, Springer-Verlag, Berlin, 1999, pp. 172-194.
[17] F. Stajano, Security for Ubiquitous Computing. John Wiley and Sons, Feb. 2002.
[18] R. Anderson and M. Kuhn, “Tamper Resistance—A Cautionary Note,” Proc. Second Usenix Workshop Electronic Commerce, 1996.
[19] A. Pfitzmann, B. Pfitzmann, and M. Waidner, “Trusting Mobile User Devices and Security Modules,” Computer, Feb. 1997.
[20] S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating Routing Misbehavior in Mobile Ad Hoc Networks,” Proc. ACM Int'l Conf. Mobile Computing and Networking (MobiCom), 2000.
[21] N. Asokan and P. Ginzboorg, “Key Agreement in Ad Hoc Networks,” Computer Comm., vol. 23, pp. 1627-1637, 2000.
[22] M. Guerrero Zapata and N. Asokan, “Securing Ad Hoc Routing Protocols,” Proc. ACM Workshop Wireless Security (WiSe), Sept. 2002.
[23] K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, E.M. Belding-Royer, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. Int'l Conf. Network Protocols (ICNP), Nov. 2002.
[24] Y.-C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,” Proc. Fourth IEEE Workshop Mobile Computing Systems and Applications, June 2002.
[25] S. Milgram, “The Small World Problem,” Psychology Today, vol. 61, 1967.
[26] J. Travers and S. Milgram, “An Experimental Study of the Small World Problem,” Sociometry, vol. 32, 1969.
[27] D. Watts, Small Worlds. Princeton Univ. Press, 1999.
[28] M. Reiter and S. Stubblebine, “Authentication Metric Analysis and Design,” ACM Trans. Information and System Security, vol. 2, no. 2, pp. 138-158, 1999.
[29] Algorithmic Solutions, “LEDA,” www.algorithmic-solutions.com, 2003.
[30] T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Comm. and Mobile Computing (WCMC): Special Issue on Mobile Ad Hoc Networking: Research, Trends, and Applications, vol. 2, no. 5, pp. 483-502, 2002.
[31] J. Luo, P.T. Eugster, and J-P. Hubaux, "Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks," Proc. IEEE Infocom 2003, IEEE Press, 2003, pp. 2229-2239.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool