Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC

被引:0
作者
Shiuh-Jeng Wang
Yuh-Ren Tsai
Chien-Chih Shen
机构
[1] Central Police University,Department of Information Management
[2] National Tsing Hua University,Institute of Communications Engineering
来源
Wireless Personal Communications | 2011年 / 56卷
关键词
Threshold; Bilinear map; Secret verifications; Multi-secret;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper, we propose a verifiable multi-secret sharing scheme. Some secrets are protected by distributing them among many participants, whereby only an authorized group of participants can reconstruct the secrets. In our scheme, the secret will change periodically and the dealer will periodically publish some of the information to increase the robustness of system, in addition, the participants can verify the information which they have received. Each participant holds only one permanent, private secret, and some of them use it during different time periods to reconstruct the corresponding shared secrets without revealing their own private information. Because some public information is renewed in our scheme, the old information has nothing to do with the next secret. We also compare our scheme to the same technique-based studies in the fields promoting the benefits we achieve in this paper.
引用
收藏
页码:173 / 182
页数:9
相关论文
共 6 条
[1]  
Shamir A.(1979)How to share a secret Communications of the ACM 22 612-613
[2]  
He J.(1995)Multistages secret sharing based on one-way function Electronics Letters 31 1591-1592
[3]  
Dawson E.(2004)A (t, n) multi-secret sharing scheme Applied Mathematics and Computation 151 483-490
[4]  
Yang C. C.(undefined)undefined undefined undefined undefined-undefined
[5]  
Chang T. Y.(undefined)undefined undefined undefined undefined-undefined
[6]  
Hwang M. S.(undefined)undefined undefined undefined undefined-undefined