| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
| |
| | Search | |
| |
| |
| | |
DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks
October-December 2005 (vol. 2 no. 4)
pp. 311-323
Securing ad hoc networks is notoriously challenging, notably due to the lack of an online infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case where an ad hoc network is under the responsibility of a mother certification authority (mCA). Since the nodes can frequently be collectively isolated from the mCA (e.g., for a remote mission) but still need the access to a certification authority, the mCA preassigns a special role to several nodes (called servers) that constitute a distributed certification authority (dCA) during the isolated period. We propose a solution, called DICTATE (DIstributed CerTification Authority with probabilisTic frEshness), to manage the dCA. This solution ensures that the dCA always processes a certificate update (or query) request in a finite amount of time and that an adversary cannot forge a certificate. Moreover, it guarantees that the dCA responds to a query request with the most recent version of the queried certificate in a certain probability; this probability can be made arbitrarily close to 1, but at the expense of higher overhead. Our contribution is twofold: 1) a set of certificate management protocols that allow trading protocol overhead for certificate freshness or the other way around, and 2) a combination of threshold and identity-based cryptosystems to guarantee the security, availability, and scalability of the certification function. We describe DICTATE in detail and, by security analysis and simulations, we show that it is robust against various attacks.
[1] 311 L. Zhou and Z. Haas, “Securing Ad Hoc Networks,” IEEE Network, vol. 13, no. 6, pp. 24-30, 1999.[2] H. Luo, J. Kong, P. Zerfos, S. Lu, and L. Zhang, “URSA: Ubiquitous and Robust Access Control for Mobile Ad-Hoc Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 6, 2004.[3] Public-Key Infrastructure (X. 509), PKIX Working Group, The Internet Eng. Task Force (IETF), http://www.ietf.org/html. charterspkix-charter.html , 2005.[4] M.K. Reiter, M.K. Franklin, J.B. Lacy, and R.N. Wright, “The $\Omega$ Key Management Service,” J. Computer Security, vol. 4, no. 4, pp. 267-287, 1996.[5] P. Zimmermann, The Official PGP User's Guide. MIT Press, 1995.[6] S. Čapkun, L. Buttyán, and J.-P. Hubaux, “Self-Organized Public-Key Management for Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 2, no. 1, pp. 52-64, 2003.[7] B. Lampson, M. Abadi, M. Burrows, and E. Wobber, “Authentication in Distributed Systems: Theory and Practice,” ACM Trans. Computer Systems, vol. 10, no. 4, pp. 265-310, 1992.[8] S. Stubblebine, “Recent-Secure Authentication: Enforcing Revocation in Distributed System,” Proc. IEEE Conf. Security and Privacy, 1995.[9] J. Luo, P.Th. Eugster, and J.-P. Hubaux, “PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 2, pp. 164-179, 2004.[10] L. Zhou, F.B. Schneider, and R. van Renesse, “COCA: A Secure Distributed Online Certification Authority,” ACM Trans. Computer Systems, vol. 20, no. 4, pp. 329-368, 2002.[11] Simple Public Key Infrastructure (SPKI), SPKI Working Group, The Internet Eng. Task Force (IETF), http://www.ietf.org/html. chartersspki-charter.html , 2004.[12] Y. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks,” Proc. ACM MobiCom'02 Conf., 2002.[13] M.G. Zapata and N. Asokan, “Securing Ad Hoc Routing Protocols,” Proc. ACM WiSe'02 Conf., 2002.[14] Y. Hu, A. Perrig, and D.B. Johnson, “Packet Leashes: A Defense Against Wormhole Attacks in Wireless Networks,” Proc. IEEE INFOCOM'03 Conf., 2003.[15] H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang, “Self-Securing Ad Hoc Wireless Networks,” Proc. IEEE Int'l Symp. Computers and Comm., 2002.[16] J. Douceur, “The Sybil Attack,” Proc. of Int'l Workshop Peer-to-Peer Systems, 2002.[17] J.-P. Hubaux, L. Buttyán, and S. Čapkun, “The Quest for Security in Mobile Ad Hoc Networks,” Proc. Mobile Ad Hoc Networking and Computing Workshop, 2001.[18] S. Yi and R. Kravets, “MOCA: Mobile Certificate Authority for Wireless Ad Hoc Networks,” Proc. Ann. PKI Research Workshop Program, 2003.[19] M. Bechler, H.-J. Hof, D. Kraft, F. Pahlke, and L. Wolf, “A Cluster-Based Security Architecture for Ad Hoc Networks,” Proc. IEEE INFOCOM '04 Conf., 2004.[20] A. Khalili, J. Katz, and W.A. Arbaugh, “Toward Secure Key Distribution in Truly Ad-Hoc Networks,” Proc. IEEE Workshop Security and Assurance in Ad hoc Networks, 2003.[21] A. Weimerskirch and G. Thonet, “A Distributed Light-Weight Authentication Model for Ad-Hoc Networks,” Proc. Fourth Int'l Conf. Information Security and Cryptology (ICISC 2001), 2001.[22] G. Montenegro and C. Castelluccia, “Statistically Unique and Cryptographically Verifiable (SUCV) Identifiers and Adresses,” Proc. Network and Distributed System Security Symp., 2002.[23] D. Malkhi, M.K. Reiter, A. Wool, and R.N. Wright, “Probabilistic Quorum Systems,” Information and Computation, vol. 170, no. 2, pp. 184-206, 2001.[24] D. Malkhi and M.K. Reiter, “Byzantine Quorum Systems,” Distributed Computing, vol. 11, no. 4, pp. 203-213, 1998.[25] W. Stallings, Cryptpgraphy and Network Security: Principle and Practices. Prentice Hall, 2003.[26] Y. Zhang, W. Lee, and Y. Huang, “Intrusion Detection Techniques for Mobile Wireless Networks,” ACM/Kluwer Wireless Networks, vol. 9, no. 5, pp. 545-556, 2003.[27] R. Gennaro, T. Rabin, S. Jarecki, and H. Krawczyk, “Robust and Efficient Sharing of RSA Functions,” J. Cryptology, vol. 13, no. 2, pp. 273-300, 2000.[28] D. Boneh and M. Franklin, “Identity-Based Encryption from the Weil Pairing,” Proc. Ann. Int'l Cryptology Conf., 2001.[29] J.C. Cha and J.H. Cheon, “An Identity-Based Signature from Gap Diffie-Hellman Groups,” Proc. Sixth Int'l Workshop Theory and Practice in Public Key Cryptography: Public Key Cryptography, 2003.[30] A. Menezes, P. van, Oorschot, and S. Vanstone Handbook of Applied Cryptography. CRC Press, 1997.[31] M. Steiner, G. Tsudik, and M. Waidner, “Key Agreement in Dynamic Peer Groups,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 8, pp. 769-780, 2000.[32] S. Buchegger and J.-Y. Le Boudec, “Performance Analysis of the CONFIDANT Protocol (Cooperation of Nodes— Fairness in Dynamic Ad-Hoc NeTworks),” Proc. ACM Int'l Symp. Mobile Ad-Hoc Networking and Computing, 2002.[33] C. Crepeau and C.R. Davis, “A Certificate Revocation Scheme for Wireless Ad Hoc Networks,” Proc. of ACM Workshop Security of Ad Hoc and Sensor Networks, 2003.[34] The ns Manual, K. Fall and K. Varadhan, eds., The VINT Project, Univ. of California at Berkeley, LBL, USC/ISI, and Xerox PARC, Apr. 2002, http://www.isi.edu/nsnamns/.[35] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, T. Imielinski and H. korth, eds., pp. 153-181, 1996.[36] J. Yoon, M. Liu, and B. Noble, “Random Waypoint Considered Harmful,” Proc. of IEEE INFOCOM'03 Conf., 2003.
Index Terms:
Index Terms- Ad hoc networks, system design, security, public-key infrastructure, Quorum Systems, simulations.
Citation:
Jun Luo, Jean-Pierre Hubaux, Patrick T. Eugster, "DICTATE: DIstributed CerTification Authority with probabilisTic frEshness for Ad Hoc Networks," IEEE Transactions on Dependable and Secure Computing, vol. 2, no. 4, pp. 311-323, Oct.-Dec. 2005, doi:10.1109/TDSC.2005.49