A Scheme for Threshold Multi-Secret Sharing

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6549

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6549

題名:	A Scheme for Threshold Multi-Secret Sharing
作者:	Chan, C. W.;Chang, C. C
關鍵詞:	Access structure;Basis of access structure;The Chinese remainder theorem;Distinctness;Entropy;Idealness;Multi-secret sharing scheme;Perfectness;The Shamir (t, n)-threshold secret sharing scheme;(t, n)-threshold access structure;Threshold multi-secret sharing scheme
日期:	2005-07
上傳時間:	2009-12-17 06:58:34 (UTC+0)
出版者:	Asia University
摘要:	A multi-secret sharing scheme is a natural generalization of the secret sharing scheme. We show the close similarity between the Chinese remainder theorem and the uniqueness theorem of interpolating polynomial. Based on the similarity, we propose a threshold multi-secret sharing scheme that is a generalization of the Shamir threshold scheme. We also show that the proposed scheme with the proposed deletion procedure can realize all possible monotone access structures.
關聯:	Applied Mathematics and Computation 166(1) : 1-14
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
		0Kb	Unknown	735	檢視/開啟
310904400-6549.doc		50Kb	Microsoft Word	287	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.