The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Membina ideal (t,n) ambang skim perkongsian rahsia membawa kepada beberapa had pada bilangan maksimum pengguna, yang dapat menyertai skim perkongsian rahsia. Kami berhasrat untuk menghapuskan had ini dengan mengurangkan kadar maklumat skim perkongsian rahsia ambang yang dibina. Dalam makalah ini kami mencadangkan algoritma pembinaan rekursif (t,n) skim perkongsian rahsia ambang, berdasarkan pembinaan ruang vektor umum. Menggunakan algoritma ini kita dapat membina (t,n) skim perkongsian rahsia ambang untuk sebarang sewenang-wenangnya n.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -