Secret sharing schemes for graph-based prohibited structures

doi:10.1016/S0898-1221(98)00177-1

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Sun, HM	en_US
dc.contributor.author	Shieh, SP	en_US
dc.date.accessioned	2019-04-02T05:59:34Z	-
dc.date.available	2019-04-02T05:59:34Z	-
dc.date.issued	1998-10-01	en_US
dc.identifier.issn	0898-1221	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0898-1221(98)00177-1	en_US
dc.identifier.uri	http://hdl.handle.net/11536/150404	-
dc.description.abstract	A secret sharing scheme for the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain prespecified subsets of participants cannot recover the master key. A secret sharing scheme is called perfect, if any subset of participants who cannot recover the master key obtains no information regarding the master key. In this paper, we propose an efficient construction of perfect secret sharing schemes for graph-based prohibited structures where a vertex denotes a participant and an edge does a pair of participants who cannot recover the master key. The information rate of our scheme is 2/n, where n is the number of participants. (C) 1998 Elsevier Science Ltd. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	cryptography	en_US
dc.subject	data security	en_US
dc.subject	information theory	en_US
dc.subject	secret sharing scheme	en_US
dc.title	Secret sharing schemes for graph-based prohibited structures	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0898-1221(98)00177-1	en_US
dc.identifier.journal	COMPUTERS & MATHEMATICS WITH APPLICATIONS	en_US
dc.citation.volume	36	en_US
dc.citation.spage	131	en_US
dc.citation.epage	140	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000076274800010	en_US
dc.citation.woscount	5	en_US
顯示於類別：	期刊論文