Recursive constructions for perfect secret sharing schemes

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Sun, HM	en_US
dc.contributor.author	Shieh, SP	en_US
dc.date.accessioned	2014-12-08T15:46:57Z	-
dc.date.available	2014-12-08T15:46:57Z	-
dc.date.issued	1999-02-01	en_US
dc.identifier.issn	0898-1221	en_US
dc.identifier.uri	http://hdl.handle.net/11536/31558	-
dc.description.abstract	A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information regarding the secret. The information rate of a secret sharing scheme is defined to be the ratio between the size of secret and the maximum size of the shares. In this paper, we propose some recursive constructions for perfect secret sharing schemes with access structures of constant rank. Compared with the best previous constructions, our constructions have some improved lower bounds on the information rate. (C) 1999 Elsevier Science Ltd. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	cryptography	en_US
dc.subject	secret sharing scheme	en_US
dc.subject	information theory	en_US
dc.subject	access structures	en_US
dc.title	Recursive constructions for perfect secret sharing schemes	en_US
dc.type	Article	en_US
dc.identifier.journal	COMPUTERS & MATHEMATICS WITH APPLICATIONS	en_US
dc.citation.volume	37	en_US
dc.citation.issue	3	en_US
dc.citation.spage	87	en_US
dc.citation.epage	96	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000078640600010	-
dc.citation.woscount	4	-
顯示於類別：	期刊論文

文件中的檔案：

000078640600010.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。