检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:薛庆水 卢子譞 杨谨瑜 Xue Qingshui;Lu Zixuan;Yang Jinyu(School of Computer Science&Information Engineering,Shanghai Institute of Technology,Shanghai 201418,China)
机构地区:[1]上海应用技术大学计算机科学与信息工程学院,上海201418
出 处:《计算机应用研究》2023年第5期1522-1527,1534,共7页Application Research of Computers
基 金:国家自然科学基金资助项目(61672350,61170227);教育部基金资助项目(39120K178038,14YJA880033);国家社会科学基金资助项目(16BGL003)。
摘 要:目前基于Shamir的数字签名方案多数仍需可信中心参与子秘密(秘密份额)的分发,缺乏成员对群管理的反向监督,缺少强前向安全性。在这些问题的前提下,提出一种无可信中心参与、多个成员可定期更新私钥,同时解决了成员加入和退出问题的方案。该方案由产生签名、私钥更新、成员加入和退出三个部分构成,涉及的运算主要有拉格朗日插值计算,有较为良好的时间复杂度,实现了去可信中心化,并在保持公钥不变的情况下定期更新成员私钥,实现成员加入退出,进而保证消息的完整性及强前向安全性。At present,under the Shamir-based digital signature scheme,most of them still need a trusted center to participate in the distribution of sub-secrets(secret shares),lack of reverse supervision of group management by members,and lack of strong forward security.Under the premise of these problems,this paper proposed a new scheme,which had no trusted center participation,and could update multiple members,private keys regularly,and solved the problem of members joining and exiting.The scheme consisted of three parts:generating signatures,private key updates,member joining and exiting.The involved operations mainly included Lagrange interpolation calculation,which had a good time complexity,and realized de-trusting centralization.It regularly updates member private keys while keeping the public key unchanged,so as to realize the ability of member joining and exiting,thereby ensuring the integrity of messages and strong forward security.
关 键 词:SHAMIR 拉格朗日插值 秘密共享方案 强前向安全 门限签名方案
分 类 号:TP309.2[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.23.59.191