On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes

Authors:
Todorka Alexandrova;Hiroyoshi Morita
Affiliations:
-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 2
Cited 0

How to share a secret

Communications of the ACM
Linear Algebra Approach to Secret Sharing Schemes

Selected papers from the Workshop on Information Protection, Error Control, Cryptology, and Speech Compression

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constructing ideal (t,n) threshold secret sharing schemes leads to some limitations on the maximum number of users, that are able to join the secret sharing scheme. We aim to remove these limitations by reducing the information rate of the constructed threshold secret sharing schemes. In this paper we propose recursive construction algorithms of (t,n) threshold secret sharing schemes, based on the generalized vector space construction. Using these algorithms we are able to construct a (t,n) threshold secret sharing scheme for any arbitrary n.