TY - GEN
T1 - A scalable key agreement scheme for large scale networks
AU - Yun, Zhou
AU - Yuguang, Fang
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2006
Y1 - 2006
N2 - Key agreement is a central problem to build up secure infrastructures for networks. Public key technology is not suitable because of its computation inefficiency and the lack of central authorities in distributed scenarios. Conventional distributed symmetric key agreement models try to achieve key agreement between any pair of nodes without interactions. They are lack of scalability because of their memory cost of N - 1 in a network of N nodes, and thus only suitable and optimum in small networks. 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. We show that for a network of N nodes our scheme has only script O sign( k√N) memory cost per node, where k ≥ 1. Conventional distributed models can be derived as special cases of our scheme. © 2006 IEEE.
AB - Key agreement is a central problem to build up secure infrastructures for networks. Public key technology is not suitable because of its computation inefficiency and the lack of central authorities in distributed scenarios. Conventional distributed symmetric key agreement models try to achieve key agreement between any pair of nodes without interactions. They are lack of scalability because of their memory cost of N - 1 in a network of N nodes, and thus only suitable and optimum in small networks. 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. We show that for a network of N nodes our scheme has only script O sign( k√N) memory cost per node, where k ≥ 1. Conventional distributed models can be derived as special cases of our scheme. © 2006 IEEE.
UR - https://www.scopus.com/pages/publications/34250197583
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-34250197583&origin=recordpage
U2 - 10.1109/icnsc.2006.1673219
DO - 10.1109/icnsc.2006.1673219
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1424400651
SN - 9781424400652
T3 - Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06
SP - 631
EP - 636
BT - Proceedings of the 2006 IEEE International Conference on Networking, Sensing and Control, ICNSC'06
T2 - 2006 IEEE International Conference on Networking, Sensing and Control (ICNSC'06)
Y2 - 23 April 2006 through 25 April 2006
ER -