By Topic

Scalable and deterministic key agreement for large scale networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yun Zhou ; Student Member ; Yuguang Fang

Key agreement is a central problem to build up secure infrastructures for networks. Public key technology may not be suitable in many networks of low-end devices, such as ad hoc networks and sensor networks, because of its computation inefficiency and the lack of central authorities in those distributed scenarios. Conventional distributed symmetric key agreement schemes lack scalability due to their large memory cost (O(N), where N is the total number of nodes), and their probabilistic nature cannot ensure key agreement between every pair of nodes. In this paper, we propose a novel symmetric key agreement scheme, which is scalable for large scale networks with very small memory cost per node. A t-degree (k+1)-variate symmetric polynomial is used to achieve key agreement between nodes. The memory cost per node for a network of N nodes is reduced to around k+1radic(k(k+1)!/2) kradicN, where k ges 1. Our scheme is also deterministic in that every pair of nodes can establish a shared key.

Published in:

IEEE Transactions on Wireless Communications  (Volume:6 ,  Issue: 12 )