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

Todorka Alexandrova, Hiroyoshi Morita

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland
Duration: 2008 Dec 72008 Dec 10

Other

Other2008 International Symposium on Information Theory and its Applications, ISITA2008
CityAuckland
Period08/12/708/12/10

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'On some properties of the (t; n) threshold secret sharing schemes based on the generalized vector space construction'. Together they form a unique fingerprint.

Cite this