Translated Titles

A Study of Optimally Essential Secret Image Sharing Scheme



Key Words

秘密影像分享 ; 關鍵分享影像 ; 非關鍵分享影像 ; 兩層式架構 ; 分享率 ; secret image sharing ; essential ; non-essential ; two-layered structure ; optimal sharing ratios



Volume or Term/Year and Month of Publication


Academic Degree Category




Content Language


Chinese Abstract

本論文提出一個兩層式結構的(t, s, k, n)關鍵秘密影像分享門檻技術,當中有s個關鍵分享影像和n-s個非關鍵分享影像,且還原回秘密影像時,需收集t個關鍵分享影像和k個分享影像,其中分享影像包括關鍵分享影像和非關鍵分享影像。在此技術中定義一個參數m,m=1時,將獲得最小的總分享影像的影像大小及關鍵分享影像的影像大小接近於非關鍵分享影像的影像大小;m=t時,將獲得關鍵分享影像的影像大小和非關鍵分享影像的影像大小為2倍關係,並且能凸顯關鍵分享影像的重要性,此外,本論文克服前人Chen的方法[3]所存在之不滿足分享門檻問題,不會造成還原時以滿足單一門檻能獲得部份秘密影像資訊的缺點,實驗結果顯示,本文方法可歸納出兩種最佳分享率的分享結果。

English Abstract

This paper presents a two-layered structure for optimally sharing a secret image among s essential and n-s non-essential shared shadows using the (t,s,k,n) essential thresholds, that t essential shared shadows and totally k shared shadows are needed to recover the secret image. The presented two-layered structure includes one user-defined parameter m to determine different kinds of optimal results. m=1 leads to minimum size of total shared shadows (ST) and size of an essential shared shadow is close to size of a non-essential shared shadow. On the other hand, m=t leads to size of an essential shared shadow being twice of size of a non-essential shared shadow to signify the importance of an essential shared shadow. Moreover, the proposed structure overcomes the threshold fulfillment problem in Chen’s scheme [13]. Theoretical analyses and experimental results show that the proposed scheme exhibits secure with optimal sharing ratios among related works.

Topic Category 基礎與應用科學 > 資訊科學
工學院 > 資訊工程學系資訊網路與多媒體碩士班
  1. [2] C. Chen and W. Wu, “A secure boolean-based multi-secret image sharing scheme,” The Journal of Systems and Software, vol. 92, pp.107-114, 2014.
  2. [3] S. Chen, “Essential secret image sharing with increasable shadows,” Optical Engineering, vol. 55, pp. 013103, 2016.
  3. [4] T. Chen and C. Wu, “Efficient multi-secret image sharing based on boolean operations,” Signal Process, vol. 91, pp. 90-97, 2011.
  4. [5] Z. Eslami and J. Zarepour Ahmadabadi, “A verifiable multi-secret sharing scheme based on cellular automata,” Information Sciences, vol. 180, pp. 2889-2894, 2010.
  5. [6] C. Huang, C. Hsieh and P. S. Huang, “Progressive sharing for a secret image,” The Journal of Systems and Software, vol. 83, pp. 517-527, 2010.
  6. [7] P. Li, C. Yang, C. Wu, Q. Kong and Y. Ma, “Essential secret image sharing scheme with different importance of shadows,” Journal of Visual Communication and Image Representation, vol. 24, pp. 1106-1114, 2013.
  7. [8] S. Lin and J. Lin, “VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches,” Pattern Recognit, vol. 40, pp. 3652-3666, 2007.
  8. [9] Z. Liu, M. A. Ahmad and S. Liu, “Image sharing scheme based on combination theory,” Optics Communications, vol. 281, pp. 5322-5325, 2008.
  9. [11] A. Shamir, “How to share a secret,” Communication of the ACM, vol. 22, pp. 612-613, 1979.
  10. [12] D. Singh and S. K. Singh, “Effective self-embedding watermarking scheme for image tampered detection and localization with recovery capability,” Journal of Visual Communication and Image Representation, vol. 38, pp. 775-789, 2016.
  11. [14] C. Thien and J. Lin, “Secret image sharing,” Computers & Graphics, Vol. 26, pp. 765-770, 2002.
  12. [15] H. Tso, “Sharing secret images using Blakley’s concept,” Optical Engineering, vol. 47, pp. 077001-077001-3, 2008.
  13. [16] R. Y. V. Subba and B. Chakravarthy, “CRT Based Threshold Multi Secret Sharing Scheme,” International Journal of Network Security 16, 249?255, 2014.
  14. [17] M. Ulutas, G. Ulutas and V. V. Nabiyev, “Invertible secret image sharing for gray level and dithered cover images,” The Journal of Systems and Software, vol. 86, pp. 485-500, 2013.
  15. [18] R. Wang, Y. Chien and Y. Lin, “Scalable user-friendly image sharing,” Journal of Visual Communication and Image Representation, vol. 21, pp. 751-761, 2010.
  16. [19] R. Wang and C. Su, “Secret image sharing with smaller shadow images. Pattern Recog,” Pattern Recognition Letters, vol. 27, pp. 551-555, 2006.
  17. [20] H. Wu and C. Chang, “Sharing visual multi-secrets using circle shares,” Computer Standards & Interfaces, vol. 28, pp. 123-135, 2005.
  18. [21] X. Wu, D. Ou, Q. Liang and W. Sun, “A user-friendly secret image sharing scheme with reversible steganography based on cellular automata,” The Journal of Systems and Software, vol. 85, pp. 1852-1863, 2012.
  19. [22] Y. Y. Lin and R. Z. Wang, “Scalable secret image sharing with smaller shadow images,” IEEE Signal Processing Letters, vol. 17, pp. 316-319, 2010.
  20. [23] C. Yang, C. Chen and S. Cai, “Enhanced boolean-based multi secret image sharing scheme,” The Journal of Systems and Software, vol. 116, pp. 22-34, 2016.
  21. [24] C. Yang, P. Li, C. Wu and S. Cai, “Reducing shadow size in essential secret image sharing by conjunctive hierarchical approach,” Signal Processing: Image Communication, vol. 31, pp. 1-9, 2015.
  22. [1] G. R. Blakley, “Safeguarding cryptographic keys,” American Federation of Information Processing Societies Proceedings, vol. 48, pp. 313-317, 1979.
  23. [10] M. C. Chien and J. I. G. Hwang, “Secret image sharing using (t,n) threshold scheme with lossless recovery,” International Conference on Image and Signal Processing (ICISP), 2012 5th International Congress on. 2012, pp. 1325-1329, 2012.
  24. [13] M. Tang, W. Song, X. Chen and J. Hu, “An image information hiding using adaptation and radix,” Optik - International Journal for Light and Electron Optics, vol. 126, pp. 4136-4141, 2015.
  25. [25] W. Stalling, “Cryptography and Network Security: Principles and Practices,” Pearson Education Inc, pp. 126-134, 2003.