摘要
基于BDH困难问题,借鉴环签密方案的思想,提出了一种有效的群组匿名认证密钥协商方案。该方案首先在实现群组成员认证的前提下,协商出安全的会话密钥;对群组内外实现了不同程度的匿名,即群组之外的用户完全不能获悉参与协商的成员组成,群组内的成员了解参与协商的成员组成,但不能识别成员的身份信息;支持节点的动态群组密钥更新,实现了群组密钥的前向保密与后向保密;仅通过一轮交互确定会话密钥,降低了计算复杂性、减小了存储开销。
With the idea of ring signcryption, an efficient anonymous group key agreement scheme is presented based on the Bilinear Diffie-Hellman (BDH) assumption. The scheme establishes a secure group key under the premise of authenticating group members. For both internal and external group members the scheme achieves different degree of anonymity, that is, the external users can absolutely not learn any information about the internal membership structure, and the internal users only can find out the member composition but cannot recognize the identity of any member. In order to achieve the forward security and backward security of group key, new scheme supports group members to renew their group key when the external nodes join the group or the internal members leave the group. The proposed scheme can establish the group session key through only one round, and therefore, its computation complexity and storage cost are efficiently reduced.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2011年第2期273-277,共5页
Journal of University of Electronic Science and Technology of China
基金
国家863计划(2007AA01Z429)
国家自然科学基金(60702059
60972078)
甘肃省自然科学基金(2007GS04823)
网络安全与密码技术福建省高校重点实验室开放课题(09A006)