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.
| Original language | English |
|---|---|
| Pages (from-to) | 2138-2150 |
| Number of pages | 13 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E91-A |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2008 Aug |
| Externally published | Yes |
Keywords
- 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