检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王岩[1] 侯整风[1] 章雪琦 黄梦洁 WANG Yan;HOU Zhengfeng;ZHANG Xueqi;HUANG Mengjie(School of Computer and Information,Hefei University of Technology,Hefei Anhui 230009,China)
机构地区:[1]合肥工业大学计算机与信息学院,合肥230009
出 处:《计算机应用》2018年第4期1041-1045,1126,共6页journal of Computer Applications
基 金:国家自然科学基金资助项目(61572167);安徽省自然科学基金资助项目(1608085MF141)~~
摘 要:针对移动攻击,提出一种基于中国剩余定理(CRT)的动态门限签名方案。首先,成员交换影子产生各自的私钥和组公钥,然后由成员协作产生部分签名,最后通过部分签名合成签名。方案在签名过程中没有暴露组私钥,从而保证组私钥可重复使用;方案允许成员定期更新私钥,且组公钥不变,以保证更新前的签名仍然有效;此外,方案允许新成员加入,并保证老成员私钥和组私钥不会泄露。分析表明,该方案具有良好的前向安全性,能够有效地抵抗移动攻击;且理论分析和仿真实验结果表明,与基于Lagrange插值多项式方案相比,该方案更新时间消耗为常数级,时间效率较高。To resist mobile attacks,a new dynamic threshold signature scheme based on Chinese Remainder Theorem(CRT)was proposed.Firstly,members exchanged their shadows to generate their private keys and the group public key.Secondly,a partial signature was generated by cooperation.Finally,the partial signature was used to synthesize the signature.The scheme does not expose the group private key in the signature process,so that the group private key can be reused.The members update their private keys periodically without changing the group public key to ensure that the signature is still valid before update.Besides,the scheme allows new members to join while keeping the old member s private keys and group private key unexposed.The scheme has forward security,which can resist mobile attacks effectively.Theoretical analysis and simulation results show that,compared with the proactive threshold scheme based on Lagrange interpolation,the updating time consumption of the proposed scheme is constant,therefore the scheme has time efficiency.
关 键 词:门限签名 中国剩余定理 移动攻击 私钥更新 成员加入
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222