Advertisement

Science China Information Sciences

, Volume 55, Issue 5, pp 1151–1161 | Cite as

(2,n) secret sharing scheme for gray and color images based on Boolean operation

  • Lin Dong
  • DaoShun WangEmail author
  • ShunDong Li
  • YiQi Dai
Research Paper

Abstract

Traditional secret sharing (SS) schemes can reconstruct the secret precisely, but have high computation complexity. Visual secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation, but have pixel expansion and loss of contrast. Wang et al. proposed a (2,n)-SS scheme for binary images based on Boolean operation, which has low computation complexity, no pixel expansion and the contrast is 1/2. In this paper, we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.’s binary (2,n)-SS scheme. Then we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color image. The two approaches are both based on Boolean operation, while one approach uses halftone technology and the other uses bit level processing. These proposed schemes have low computation complexity and almost ideal contrast.

Keywords

secret sharing scheme Boolean operation halftone contrast 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blakley G R. Safeguarding cryptographic keys. Proc AFIPS NCC, 1979, 48: 313–317Google Scholar
  2. 2.
    Shamir A. How to share a secret. Commun ACM, 1979, 22: 612–613MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Thien C C, Lin J C. Secret image sharing. Comput Graph, 2002, 26: 765–770CrossRefGoogle Scholar
  4. 4.
    Thien C C, Lin J C. An image-sharing method with user-friendly shadow images. IEEE Trans Circ Syst Vid Tech, 2003, 13: 1161–1169CrossRefGoogle Scholar
  5. 5.
    Wang R Z, Su C H. Secret image sharing with smaller shadow images. Pattern Recogn, 2006, 27: 551–555MathSciNetCrossRefGoogle Scholar
  6. 6.
    Naor M, Shamir A. Visual cryptography. In: Advances in Cryptology-EUROCRYPTO’94. Berlin: Springer-Verlag, 1995. 950: 1–12Google Scholar
  7. 7.
    Yang C N. New visual secret sharing schemes using probabilistic method. Pattern Recogn, 2004, 25: 481–494CrossRefGoogle Scholar
  8. 8.
    Cimato S, Prisco R D, Santis A D. Probabilistic visual cryptography schemes. Comput J, 2006, 49: 97–107CrossRefGoogle Scholar
  9. 9.
    Hou Y C. Visual cryptography for color images. Pattern Recogn, 2003, 36: 1619–1629CrossRefGoogle Scholar
  10. 10.
    Zhou Z, Gonzalo R A, Crescenzo G D. Halftone visual cryptography. IEEE Trans Image Process, 2006, 15: 2441–2453CrossRefGoogle Scholar
  11. 11.
    Wang D S, Zhang L, Ma N, et al. Two secret sharing schemes based on Boolean operations. Pattern Recogn, 2007, 40: 2776–2785zbMATHCrossRefGoogle Scholar
  12. 12.
    Chao K Y, Lin J C. Secret image sharing: a Boolean-operations-based approach combining benefits of polynomial-based and fast approaches. Int J Pattern Recogn Artif Intell, 2009, 23: 263–285CrossRefGoogle Scholar
  13. 13.
    Chang C C, Lin C C, Le T, et al. A probabilistic visual secret sharing scheme for grayscale images with voting strategy. In: International Symposium on Electronic Commerce and Security, Guangzhou, 2008. 184–188Google Scholar
  14. 14.
    Chang C C, Lin C C, Le T, et al. A new probabilistic visual secret sharing scheme for color images. In: 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Harbin, 2008. 1305–1308Google Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina
  2. 2.School of Computer ScienceShaanxi Normal UniversityXi’anChina

Personalised recommendations