| Threshold Decryption Scheme with Multiple Policies |
| |
| 作者姓名： | FEIRu-chun WANGLi-na |
| |
| 作者单位： | SchoolofComputer,WuhanUniversity,Wuhan130072,Hubei,China |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina(90104005,90204011)andtheNaturalScienceFoundationofHubeiProvince(2002AB0039) |
| |
| 摘 要： | Based on the difficulty in computing discrete logarithm and square root on some special conditions, we propose a basic threshold secret sharing scheme for muhiple secrets with muhiple policies, which allows a group of users to share muhiple secret keys and only one secret shadow to be kept by each user. An efficient threshold decryption scheme with multiple policies is designed on the basis of the basic threshold scheme. This decryption scheme allows muhiple secret keys to be shared among a group of users, and each user to keep only one secret shadow. Different public keys can be used to encrypt documents. If and only if the number of cooperated users who keep the secret shadows is greater than or equal to the threshold value of the corresponding secret key, they can cooperate to decrypt the documents. It is proved that the proposed scheme has very strong security, unless the at tackers can solve the discrete logarithm problem and the square root problem.
|
| 关 键 词： | 域值设计 解密 多重密钥 离散算法 平方根 公钥 |
| 收稿时间： | 16 May 2004 |
Threshold decryption scheme with multiple policies |
| |
| FEIRu-chun WANGLi-na.Threshold Decryption Scheme with Multiple Policies[J].Wuhan University Journal of Natural Sciences,2005,10(1):243-247. |
| |
| Authors: | Fei Ru-chun Wang Li-na |
| |
| Institution: | (1) School of Computer, Wuhan University, 430072, Hubei Wuhan, China |
| |
| Abstract: | Based on the difficulty in computing discrete logarithm and square root on some special conditions, we propose a basic threshold secret sharing scheme for multiple secrets with multiple policies, which allows a group of users to share multiple secret keys and only one secret shadow to be kept by each user. An efficient threshold decryption scheme with multiple policies is designed on the basis of the basic threshold scheme. This decryption scheme allows multiple secret keys to be shared among a group of users, and each user to keep only one secret shadow. Different public keys can be used to encrypt documents. If and only if the number of cooperated users who keep the secret shadows is greater than or equal to the threshold value of the corresponding secret key, they can cooperate to decrypt the documents. It is proved that the proposed scheme has very strong security, unless the attackers can solve the discrete logarithm problem and the square root problem. |
| |
| Keywords: | multiple secret keys threshold scheme secret shadow discrete logarithm square root threshold decryption scheme |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
