Boolean-Based (k, n, m) Multi-Secret Image Sharing

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/122968

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/122968

题名:	Boolean-Based (k, n, m) Multi-Secret Image Sharing
作者:	Chen, Chien-Chang;Lin, Cheng-Shian;Chen, Jia-Zhan
关键词:	secret image sharing;Boolean-based;multiple sharing
日期:	2022-04-23
上传时间:	2023-04-28 16:33:01 (UTC+8)
出版者:	MDPI AG
摘要:	Multi-secret image sharing technology shares multiple secret images among shared images for participants and the recovery requires enough shared images for fulfilling the security property. Simultaneously, the adopted Boolean method preserves high performance. The proposed (k, n, m) multi-secret image sharing scheme shares m secret images among n participants and gathering k participants’ shared images perfectly recovers these m secret images. The proposed scheme exhibits high performance because of the usage of Boolean-based processing. Moreover, the usage of a sharing matrix based strategy acquires perfect reconstruction of the secret images under (k, n) thresholds. Two proposed schemes, the source-random-mixed (SRM) and the source-random-separate (SRS) methods, are presented in this study from different strategies of sharing the random image mixed with the secret images or separated to the secret images, respectively. Moreover, the proposed SRS method exhibits the better sharing capacity. Experimental results show that the proposed schemes perform well on sharing efficiency and security.
關聯:	Axioms 11(5), 197
DOI:	10.3390/axioms11050197
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	116	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章