On increasing the number of users in (t, n) threshold secret sharing schemes

Todorka Alexandrova*, Hiroyoshi Morita

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)2138-2150
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number8
Publication statusPublished - 2008 Aug
Externally publishedYes


  • Bounds on number of users
  • Information rate
  • Recursive construction algorithm
  • Threshold secret sharing systems

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing


Dive into the research topics of 'On increasing the number of users in (t, n) threshold secret sharing schemes'. Together they form a unique fingerprint.

Cite this