摘要
针对现有大部分群密钥协商协议只能检测出非法用户而不能快速地识别非法用户的问题,提出了一种新的基于对称双变量多项式的群密钥协商协议,该协议利用对称双变量多项式的对称性设计了一种高效的识别非法用户的方法。在密钥验证阶段,每个用户不需要复杂的模指数运算,也不需要存储其他用户的公钥;在非法用户识别阶段,每个用户只需校验用户密钥份额的哈希值是否相等,而不需要进行大量的计算。此外,还分析了该协议的正确性和安全性。
Most of the existing group key agreement protocols can only detect illegal users,but fail to identify illegal users quickly.To solve this problem,we propose a new group key agreement protocol based on the symmetric bivariate polynomials.By taking advantage of the symmetry of the symmetric bivariate polynomials,this protocol aims to design an efficient method for identifying illegal users.In the key verification phase,each user does not either carry out the complicated modular exponentiation or store the public keys of other users.Each user only needs to check whether the hash values of user s shares are equal or not in the stage of identifying illegal users instead of performing a lot of calculations.In addition,we examine the accuracy and security of the proposed protocol.
作者
庄锋茂
林修慧
林昌露
ZHUANG Fengmao;LIN Xiuhui;LIN Changlu(Department of Physical Education and Health Care,Fujian Sports Vocational Education and Technical College,Fuzhou Fujian 350003,China;College of Mathematics and Informatics,Fujian Normal University,Fuzhou Fujian 350117,China)
出处
《莆田学院学报》
2020年第5期87-90,共4页
Journal of putian University
基金
国家自然科学基金资助项目(61572132)
福建省自然科学基金资助项目(2019J01275)。
关键词
群密钥协商
对称双变量多项式
秘密分享
哈希函数
group key agreement
symmetric bivariate polynomial
secret sharing
Hash function
