On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction

Todorka Alexandrova; Hiroyoshi Morita

doi:10.1109/ISITA.2008.4895378

On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction

Todorka Alexandrova^*, Hiroyoshi Morita

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper some of the properties of the (t; n) threshold secret sharing schemes, based on the generalized vector space construction, are discussed. The relations between the size of the shares and the number of the users n in the (t; n) threshold secret sharing schemes are presented. Moreover, it is shown how a qualified set of users can effciently recover the secret in case of (2; n) and (3; n) threshold secret sharing schemes, exploiting the regular structure of the matrices corresponding to each of the n users.

Original language	English
Title of host publication	2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs	https://doi.org/10.1109/ISITA.2008.4895378
Publication status	Published - 2008
Externally published	Yes
Event	2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland Duration: 2008 Dec 7 → 2008 Dec 10

Other

Other	2008 International Symposium on Information Theory and its Applications, ISITA2008
City	Auckland
Period	08/12/7 → 08/12/10

ASJC Scopus subject areas

Computer Science(all)

Access to Document

10.1109/ISITA.2008.4895378

Cite this

Alexandrova, T & Morita, H 2008, On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction. in 2008 International Symposium on Information Theory and its Applications, ISITA2008., 4895378, 2008 International Symposium on Information Theory and its Applications, ISITA2008, Auckland, 08/12/7. https://doi.org/10.1109/ISITA.2008.4895378

@inproceedings{a6b9c35e16d342a78afee8c871374f70,

title = "On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction",

abstract = "In this paper some of the properties of the (t; n) threshold secret sharing schemes, based on the generalized vector space construction, are discussed. The relations between the size of the shares and the number of the users n in the (t; n) threshold secret sharing schemes are presented. Moreover, it is shown how a qualified set of users can effciently recover the secret in case of (2; n) and (3; n) threshold secret sharing schemes, exploiting the regular structure of the matrices corresponding to each of the n users.",

author = "Todorka Alexandrova and Hiroyoshi Morita",

year = "2008",

doi = "10.1109/ISITA.2008.4895378",

language = "English",

isbn = "9781424420698",

booktitle = "2008 International Symposium on Information Theory and its Applications, ISITA2008",

note = "2008 International Symposium on Information Theory and its Applications, ISITA2008 ; Conference date: 07-12-2008 Through 10-12-2008",

}

TY - GEN

T1 - On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction

AU - Alexandrova, Todorka

AU - Morita, Hiroyoshi

PY - 2008

Y1 - 2008

N2 - In this paper some of the properties of the (t; n) threshold secret sharing schemes, based on the generalized vector space construction, are discussed. The relations between the size of the shares and the number of the users n in the (t; n) threshold secret sharing schemes are presented. Moreover, it is shown how a qualified set of users can effciently recover the secret in case of (2; n) and (3; n) threshold secret sharing schemes, exploiting the regular structure of the matrices corresponding to each of the n users.

AB - In this paper some of the properties of the (t; n) threshold secret sharing schemes, based on the generalized vector space construction, are discussed. The relations between the size of the shares and the number of the users n in the (t; n) threshold secret sharing schemes are presented. Moreover, it is shown how a qualified set of users can effciently recover the secret in case of (2; n) and (3; n) threshold secret sharing schemes, exploiting the regular structure of the matrices corresponding to each of the n users.

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

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

U2 - 10.1109/ISITA.2008.4895378

DO - 10.1109/ISITA.2008.4895378

M3 - Conference contribution

AN - SCOPUS:77951130265

SN - 9781424420698

BT - 2008 International Symposium on Information Theory and its Applications, ISITA2008

T2 - 2008 International Symposium on Information Theory and its Applications, ISITA2008

Y2 - 7 December 2008 through 10 December 2008

ER -

On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this