Paper 2013/524

Threshold Secret Image Sharing

Teng Guo, Feng Liu, ChuanKun Wu, ChingNung Yang, Wen Wang, and YaWei Ren

Abstract

A (k; n) threshold secret image sharing scheme, abbreviated as (k; n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k; n)-TSISS, Thien and Lin reduced the size of each shadow image to 1/k of the original secret image. Their main technique is by adopting all coefficients of a (k-1)-degree polynomial to embed the secret pixels. This benet of small shadow size has drawn many researcher's attention and their technique has been extensively used in the following studies. In this paper, we rst show that this technique is neither information theoretic secure nor computational secure. Furthermore, we point out the security defect of previous (k; n)-TSISSs for sharing textual images, and then fix up this security defect by adding an AES encryption process. At last, we prove that this new (k; n)-TSISS is computational secure.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. Minor revision. ICICS 2013
Keywords
Secret image sharingSecurity defectComputational secure
Contact author(s)
guoteng @ iie ac cn
History
2013-08-30: received
Short URL
https://ia.cr/2013/524
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/524,
      author = {Teng Guo and Feng Liu and ChuanKun Wu and ChingNung Yang and Wen Wang and YaWei Ren},
      title = {Threshold Secret Image Sharing},
      howpublished = {Cryptology ePrint Archive, Paper 2013/524},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/524}},
      url = {https://eprint.iacr.org/2013/524}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.