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

Authors:
Shiuh-Jeng Wang;Yuh-Ren Tsai;Chien-Chih Shen
Affiliations:
Department of Information Management, Central Police University, TaoYuan, Taiwan 33304;Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan 30013;Institute of Communications Engineering, National Tsing Hua University, Hsinchu, Taiwan 30013
Venue:
Wireless Personal Communications: An International Journal
Year:
2011

Citing 5
Cited 1

How to share a secret

Communications of the ACM
On Sharing Many Secrets (Extended Abstract)

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A new multi-stage secret sharing scheme using one-way function

ACM SIGOPS Operating Systems Review
A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps

ICPPW '07 Proceedings of the 2007 International Conference on Parallel Processing Workshops
A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP

SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02

A New Verifiable Multi-secret Sharing Scheme Based on Bilinear Maps

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.