Efficient Secret Sharing Schemes Based on Unauthorized Subsets

We propose two multiple assignment secret sharing schemes realizing general access structures. One is always more efficient than the secret sharing scheme proposed by Ito, Saito and Nishizeki [5] from the viewpoint of the number of shares distributed to each participant. The other is also always mor...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2008/10/01, Vol.E91.A(10), pp.2860-2867
1. Verfasser:	TOCHIKUBO, Kouya
Format:	Artikel
Sprache:	eng
Schlagworte:	(k,n)-threshold scheme COM Electronics general access structure multiple assignment secret sharing scheme Unauthorized
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We propose two multiple assignment secret sharing schemes realizing general access structures. One is always more efficient than the secret sharing scheme proposed by Ito, Saito and Nishizeki [5] from the viewpoint of the number of shares distributed to each participant. The other is also always more efficient than the scheme I of [7].
ISSN:	0916-8508 1745-1337 1745-1337
DOI:	10.1093/ietfec/e91-a.10.2860