| 二次剩余下改进He-Dawson的多秘密共享方案 |
| |
| 引用本文： | 白凤伟,闫德勤,张鑫彦,郑宏亮. 二次剩余下改进He-Dawson的多秘密共享方案[J]. 计算机工程与应用, 2011, 47(13): 113-115. DOI: 10.3778/j.issn.1002-8331.2011.13.032 |
| |
| 作者姓名： | 白凤伟 闫德勤 张鑫彦 郑宏亮 |
| |
| 作者单位： | 辽宁师范大学,计算机与信息技术学院,辽宁,大连,116081 |
| |
| 基金项目： | 国家自然科学基金，中国科学院自动化研究所复杂系统与智能科学重点实验室开放课题基金，辽宁省教育厅高等学校科学研究基金，大连市科技局科技计划项目 |
| |
| 摘 要： | 研究了He-Dawson所提出的基于单向函数的多步骤秘密共享方案,指出该方案是一次方案而且不能抵抗合谋攻击,结合基于身份验证的密码学多秘密共享方案和利用二次剩余构造的数字签名方案,提出了一种利用二次剩余构造一个多秘密共享方案,该方案功能是一种(t,n)门限的多秘密共享方案。该方案中,由秘密分发者分发秘密,但每个参与者可以验证由秘密分发者分发的秘密,可以防止秘密分发者的欺骗,并且每个参与者能够验证其他合作者的欺骗。另外,每个参与者选取的子秘密可以复用,组秘密可以以任意顺序重构,同时该方案还能够抵抗合谋攻击。其安全性是基于Shamir门限方案和RSA密钥体制。在大整数分解困难离散对数难分解等问题的假设下,证明了提出的方案是安全的。
|
| 关 键 词： | 二次剩余 多秘密共享 大整数分解 离散对数分解 |
| 修稿时间： | |
Improved He-Dawson's multi-secret sharing scheme under the quadratic residue |
| |
| BAI Fengwei,YAN Deqin,ZHANG Xinyan,ZHENG Hongliang. Improved He-Dawson's multi-secret sharing scheme under the quadratic residue[J]. Computer Engineering and Applications, 2011, 47(13): 113-115. DOI: 10.3778/j.issn.1002-8331.2011.13.032 |
| |
| Authors: | BAI Fengwei YAN Deqin ZHANG Xinyan ZHENG Hongliang |
| |
| Affiliation: | College of Computer and Information Technology,Liaoning Normal University,Dalian,Liaoning 116081,China |
| |
| Abstract: | He-Dawson one-way function based on multi-step secret sharing scheme is studied.The scheme is a time schemeand can not resist collusion attacks.Based on authentication,cryptographic multi-secret sharing scheme and the use of quadrat-ic residue a digital signature scheme is proposed by means of a quadratic residue to construct a multi-secret sharing scheme.The scheme is a（t,n） threshold multi-secret sharing scheme.In the scheme,a secret is distributed by the distributor,buteach participant can verify the distribution by the distributor of a secret,which can prevent the deception of secret distribu-tor,and each participant can verify other partners’cheating.In addition,for each participant,selected sub-secret can be re-used,and group secret can be reconstructed in any order,while the scheme is also able to resist collusion attacks.Safety of thescheme is based on Shamir threshold scheme,and RSA keys system.Under the assumption of difficulty in large integer factor-ization and the difficulty of discrete log decomposition,the proposal is proved to be safe |
| |
| Keywords: | quadratic residue multi-secret sharing decomposition of integers decomposition of discrete logarithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
|
