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

Research output: Contribution to journalArticlepeer-review

35 Scopus citations

Abstract

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).

Original languageEnglish
Pages (from-to)263-285
Number of pages23
JournalInternational Journal of Pattern Recognition and Artificial Intelligence
Volume23
Issue number2
DOIs
StatePublished - 1 Mar 2009

Keywords

  • Computation complexity
  • Exclusive-OR
  • Fast schemes
  • Pixel expansion rate
  • Polynomial-style sharing

Fingerprint Dive into the research topics of 'Secret image sharing: A Boolean-operations-based approach combining benefits of polynomial-based and fast approaches'. Together they form a unique fingerprint.

Cite this