Constant-round Contributory Group Key Agreement for Ad hoc Networks
Because of the nature of ad hoc networks, protecting communication in this environment is difficult. Most existing group key management techniques are not suited to the ad hoc network environment. To overcome this problem, in this paper we propose to utilize techniques of identity-based (ID-based) cryptography and Lees two-round contributory group key agreement to provide a mechanism that meets the following two challenges in ad hoc networks: 1, exchanged messages being authenticated without online TTP; 2, possessing some degree ability to resist unstable links. Discussion about security and robustness of our proposed scheme was given at the end of this paper.
Constant round contributory group key agreement ad hoc networks identity-based cryptosystem
Peng Zhang Chengqing Ye Xin Li Yanhua Cheng Xueying Ma
Dept.of Computer Science, Zhejiang University,Hangzhou P.R.China Dept.of Information Management, Zhejiang Institute of Finance & Economics Hangzhou P.R.China
国际会议
武汉
英文
1199-1202
2005-09-23(万方平台首次上网日期,不代表论文的发表时间)