On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.8 pp.2138-2150
- Publication Date
- 2008/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.8.2138
- Type of Manuscript
- PAPER
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Todorka ALEXANDROVA, Hiroyoshi MORITA, "On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 8, pp. 2138-2150, August 2008, doi: 10.1093/ietfec/e91-a.8.2138.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.8.2138/_p
Copy
@ARTICLE{e91-a_8_2138,
author={Todorka ALEXANDROVA, Hiroyoshi MORITA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes},
year={2008},
volume={E91-A},
number={8},
pages={2138-2150},
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.},
keywords={},
doi={10.1093/ietfec/e91-a.8.2138},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - On Increasing the Number of Users in (t, n) Threshold Secret Sharing Schemes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2138
EP - 2150
AU - Todorka ALEXANDROVA
AU - Hiroyoshi MORITA
PY - 2008
DO - 10.1093/ietfec/e91-a.8.2138
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2008
AB - 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.
ER -
English
