An improved multi-stage (t, n)-threshold secret sharing scheme

Authors:
Hui-Xian Li;Chun-Tian Cheng;Liao-Jun Pang
Affiliations:
School of Electronic and Information Engineering, Dalian University of Technology, Dalian, China;Institute of Hydroinformatics, Dalian University of Technology, Dalian, China;National Key Labtorary of Integrated Service Networks, Xidian University, Xi’an, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 8
Cited 0

Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On Sharing Many Secrets (Extended Abstract)

ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Sharing one secret vs. sharing many secrets

Theoretical Computer Science - Mathematical foundations of computer science
A new multi-stage secret sharing scheme using one-way function

ACM SIGOPS Operating Systems Review
Research note: Cheater identification in (t,n) threshold scheme

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Chang et al. proposed a multi-stage (t, n)-threshold secret sharing scheme based on the one-way function. For k secrets shared among n participants, each participant has to keep one secret shadow; but there are a total of kn public values. In this paper, a new multi-stage (t, n)-threshold secret sharing scheme was proposed, which is an alternative implementation of Chang etal.’s scheme. Each participant needs to keep only one secret shadow in sharing multiple secrets without updating each participant’s secret shadow. For k secrets shared among n participants, there are only a total of k(n-t+1) public values. Analyses show that the proposed scheme is a computationally secure and efficient scheme. The implementation of the proposed scheme becomes very attractive, especially when the threshold value t is very close to the number of participants n.