Abstract
The infrastructure-less property of wireless ad hoc network makes the traditional central server based security management schemes unsuitable and requires the use of a distributed key management mechanism. In this paper, we propose a distributed pairwise key establishment scheme based on the concept of bivariate polynomials. In our method, any mobile node in an ad hoc network can securely communicate with other nodes just by knowing their corresponding IDs. The bivariate polynomials are shared in such a manner that the shares depend on the coefficient matrix of the polynomial, the requesting node’s ID and the ID of the nodes that respond to the request. We study the behavior of our scheme through simulations and show that our scheme compares well with other schemes and has a much better performance when averaged over the lifetime of the network.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, M. Yung, Perfectly-secure key distribution for dynamic conferences, Advancesin Cryptology — CRYPTO’ 92, LNCS 740 1993.
H. Chan, A. Perrig, D. Song, Random key predistribution schemes for sensor networks, Proceedings of the IEEE Symposium on Research in Security and Privacy, 2003.
H. Deng, A. Mukherjee, and D. P. Agrawal, Threshold and Identity-based Key Management and Authentication for Wireless Ad Hoc Networks, IEEE International Conferences on Information Technology (ITCC’04), April 5–7, 2004.
L. Eschenauer and V.D. Gligor, A key-management scheme for distributed sensor networks, Proceedings of he 9 th ACM Conference on Computer and Communications Security, November 2002.
J. Kong, P. Zerfos, H. Luo, S. Lu and L. Zhang, Providing Robust and Ubiquitous Security Support for Mobile Ad-Hoc Networks, Proceedings of the IEEE 9th International Conference on Network Protocols (ICNP’01), 2001.
A. L. Murphy, G.-C. Roman, G. Varghese, An Exercise in Formal Reasoning about Mobile Communications, Proceedings of the Ninth International Workshop on Software Specifications and Design, IEEE Computer Society Technical Council on Software Engineering, IEEE Computer Society, Ise-Shima, Japan, pp.25–33, April 1998.
P. Papadimitratos and Z. Haas, Secure Routing for Mobile Ad Hoc Networks, Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, January 2002.
A. Shamir, How to share a secret, Communications of the ACM, Vol. 22, pp. 612–613, November 1979.
L. Zhou and Zygmunt J. Haas, Securing ad hoc networks, IEEE Network, 13(6):24–30, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Mukherjee, A., Deng, H., Agrawal, D.P. (2005). Distributed Pairwise Key Generation Using Shared Polynomials for Wireless Ad Hoc Networks. In: Belding-Royer, E.M., Al Agha, K., Pujolle, G. (eds) Mobile and Wireless Communication Networks. MWCN 2004. IFIP International Federation for Information Processing, vol 162. Springer, Boston, MA. https://doi.org/10.1007/0-387-23150-1_19
Download citation
DOI: https://doi.org/10.1007/0-387-23150-1_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23148-8
Online ISBN: 978-0-387-23150-1
eBook Packages: Computer ScienceComputer Science (R0)