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

Todorka Alexandrova, Hiroyoshi Morita

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)2138-2150
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE91-A
Issue number8
DOIs
Publication statusPublished - 2008 Aug
Externally publishedYes

Fingerprint

Threshold Scheme
Secret Sharing Scheme
Vector spaces
Information Rates
Join
Vector space
Arbitrary

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

Cite this

On increasing the number of users in (t, n) threshold secret sharing schemes. / Alexandrova, Todorka; Morita, Hiroyoshi.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E91-A, No. 8, 08.2008, p. 2138-2150.

Research output: Contribution to journalArticle

@article{e1e0c129fdd94446a06a68af794482cc,
title = "On increasing the number of users in (t, n) threshold secret sharing schemes",
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 = "Bounds on number of users, Information rate, Recursive construction algorithm, Threshold secret sharing systems",
author = "Todorka Alexandrova and Hiroyoshi Morita",
year = "2008",
month = "8",
doi = "10.1093/ietfec/e91-a.8.2138",
language = "English",
volume = "E91-A",
pages = "2138--2150",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

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

AU - Alexandrova, Todorka

AU - Morita, Hiroyoshi

PY - 2008/8

Y1 - 2008/8

N2 - 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.

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.

KW - Bounds on number of users

KW - Information rate

KW - Recursive construction algorithm

KW - Threshold secret sharing systems

UR - http://www.scopus.com/inward/record.url?scp=77951112974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951112974&partnerID=8YFLogxK

U2 - 10.1093/ietfec/e91-a.8.2138

DO - 10.1093/ietfec/e91-a.8.2138

M3 - Article

AN - SCOPUS:77951112974

VL - E91-A

SP - 2138

EP - 2150

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 8

ER -