Secret image sharing: A Boolean-operations-based approach combining benefits of polynomial-based and fast approaches

Kun Yuan Chao*, Chih_Ching Lin

*Corresponding author for this work

研究成果: Article同行評審

35 引文 斯高帕斯(Scopus)

摘要

In secret image sharing, a polynomial interpolation technique heavy experiences a computation load when the secret image is retrieved later. To the contrary, fast approaches often need larger storage space due to pixel expansion property. This paper proposes a missing-allowable (k, n) scheme which is fast and with a reasonable pixel expansion rate (per). The scheme generates n extremely-noisy shadow images for the given secret color image A, and any k out of these n shadows can recover A loss-freely. In average, to decode a color pixel of A, the retrieval uses only three exclusion-OR operations among 24-bit numbers. Hence, the new method has very fast decoding speed, and its pixel expansion rate is always acceptable (0 < per < 2).

原文English
頁(從 - 到)263-285
頁數23
期刊International Journal of Pattern Recognition and Artificial Intelligence
23
發行號2
DOIs
出版狀態Published - 1 三月 2009

指紋 深入研究「Secret image sharing: A Boolean-operations-based approach combining benefits of polynomial-based and fast approaches」主題。共同形成了獨特的指紋。

引用此