Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Alexandrova, T. ; Grad. Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu ; Morita, H.

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

Published in:
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on

Date of Conference: 7-10 Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.