A Key Management Scheme for Sensor Networks Using Bilinear Pairings and Gap Diffie-Hellman Group

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6349

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6349

题名:	A Key Management Scheme for Sensor Networks Using Bilinear Pairings and Gap Diffie-Hellman Group
作者:	Chang, C. C.;Chang, P. Y.;Lin, I. C.
关键词:	Key agreement, Bilinear pairing, Gap Diffie-Hellman group, Sensor networks
日期:	2009-03
上传时间:	2009-12-17 06:57:28 (UTC+0)
出版者:	Asia University
摘要:	To make wireless sensor network more suitable in practical use, researchers have to develop an efficient method to ensure secure data transmission through sensor nodes. Since sensor nodes do not have good computational ability, it is hard to be applied in complex computations, such as exponential computation to design a key management scheme. Therefore, the existing key management schemes in sensor networks usually employ the method of random key pre-distribution to achieve the security of communications and reduce the overheads of computations and storage. However, random key pre-distribution method has a drawback that any pair of sensor nodes cannot guarantee to hold the same shared key to construct a secure channel in between. In this paper, we are going to propose a novel key agreement scheme which can ensure that any pair of node can securely negotiate one session key. Furthermore, the required computational overheads are acceptable because the scheme is based on Bilinear Pairing and Gap DiffieHellman Group. As a result, our scheme is more suitable for being applied in wireless sensor networks.
關聯:	International Journal of Innovative Computing, Information and Control
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	330	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.

数据加载中.....