计算机科学 ›› 2011, Vol. 38 ›› Issue (8): 58-60.

• 计算机网络与信息安全 • 上一篇    下一篇

一种基于双线性对的群密钥管理方案

周健,周贤伟,孙丽艳   

  1. (北京科技大学信息工程学院 北京100081);(安徽财经大学管理科学与工程学院 蚌埠233041)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家自然科学基金资助项目(60773074),国家863计划项目(2007AA01G213,2009AA01Z209 ),安徽省高等学校自然科学研究基金项目(KJ2010B005)和安徽省高校优秀青年人才基金项目(2009SQRZ084)资助。

Group Key Management Scheme Based on Bilinear Pairing

ZHOU Jian,ZHOU Xian-wei,SUN Li-yan   

  • Online:2018-11-16 Published:2018-11-16

摘要: 现有群密钥管理方案大都基于GDH(Group key Management Based on Diffi}Hellman)密钥交互协议,该协议限制了子树规模。针对这一问题,提出一种基于双线性对的群密胡管理方案(13PGKM, Group Kcy Managcmcnt based on I3ifinear Pairing),该方案在保证安全的前提下可扩大密钥树中子树的规模,以支持更大规模的网络,同时可使计算操作减少一半,以提高群密钥管理操作的效率。

关键词: 群密钥管理,双线性对,共享密钥,安全,效率

Abstract: Current schemes on group key management arc almost based on GDH (Group key Management Based on Diffie-Hellman)protocol,and their sub tree in key tree is limit To solve the ctuestion,this paper put forwards a new scheme based on bilinear pairing (BPGKM) , which increases the children of node in key tree from two to three. Therefore, this scheme supports larger networks on the premise of protecting the network security, whose efficiency is better than current schemes with reducing half of computations on key.

Key words: Group key management, Bilinear pairing, Shared key, Security, Efficiency

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!