Skip to main content
SpringerLink
Log in

Secret Image Sharing Scheme Based on Pixel Replacement

  • Conference paper
Quality, Reliability, Security and Robustness in Heterogeneous Networks (QShine 2013)

  • 2737 Accesses

Abstract

Dividing an image in several components and sharing through different channel is popular way of sharing and storing sensitive image data. We proposes here a simple image secret sharing method based on random matrices. These random matrices act as key for secret sharing. The technique allows a secret image to be divided into three image shares where each share individually looks meaningless. To reconstruct the secret image all three shares have to be used. This method has no pixel expansion and can reconstruct the secret image precisely. This scheme can be directly applied on gray scale images and can easily be extended to binary and color images. Experimental results prove that this scheme can generate good quality of reconstructed images.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blakley, G.R.: Safeguarding cryptographic keys. AFIPS NCC 48, 313–317 (1979)

    Google Scholar 

  2. Samir, A.: How to share a secret. Communications of ACM 22(11), 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  3. Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. Information Theory 29(1), 35–41 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  4. Brickell, E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 6, 105–113 (1989)

    MathSciNet  MATH  Google Scholar 

  5. Cimato, S., De Prisco, R., De Santis, A.: Optimal colored threshold visual cryptography schemes. Designs Codes and Cryptography 35(3), 311–315 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Thien, C.C., Lin, J.C.: Secret image sharing. Computers and Graphics 26(5), 665–670 (2002)

    Article  Google Scholar 

  7. Bai, L.: A strong ramp secret sharing scheme using matrix projection. In: 2nd Intl. Workshop on Trust, Security and Privacy for Ubiquitous Computing, pp. 656–660. IEEE (2006)

    Google Scholar 

  8. Tuyls, P., Hollmann, H.D.L., van Lint, J.H., Tolhuizen, L.: Xor-based visual cryptography schemes. Designs Codes and Cryptography 37, 169–186 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  9. Yi, F., Wang, D.S., Luo, P., Dai, Y.Q.: Two new color (n, n)-secret sharing schemes. Journal on Communications 28(5), 30–35 (2007)

    Google Scholar 

  10. Wang, D., Zhang, L., Ma, N., Li, X.B.: Two secret sharing schemes based on boolean operations. Pattern Recognition 40(10), 2776–2785 (2007)

    Article  MATH  Google Scholar 

  11. Chang, C.C., Hsieh, Y.P., Lin, C.H.: Sharing secrets in stego images with authentication. Pattern Recognition 41(10), 3130–3137 (2008)

    Article  MATH  Google Scholar 

  12. Zhao, R., Zhao, J.J., Dai, F., Zhao, F.Q.: A new image secret sharing scheme to identify cheaters. Computer Standards and Interfaces 31(1), 252–257 (2009)

    Article  Google Scholar 

  13. Chao, K.Y., Lin, J.C.: Secret image sharing: a boolean-operations based approach combining benefits of polynomial-based and fast approaches. International Journal of Pattern Recognition and Artificial Intelligence 23(2), 263–285 (2009)

    Article  MathSciNet  Google Scholar 

  14. Dong, L., Ku, M.: Novel (n, n) secret image sharing scheme based on addition. In: 6th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp. 583–586 (2010)

    Google Scholar 

  15. Singh, J.P., Nag, A., Bhattacharjee, T.: Random matrices based image secret sharing. International Journal of Advanced Research in Computer Science 2(4), 104–108 (2011)

    Google Scholar 

  16. Li, P., Ma, P.-J., Su, X.-H., Yang, C.-N.: Improvements of a two-in-one image secret sharing scheme based on gray mixing model. Journal of Visual Communication and Image Representation 23(3), 441–453 (2012)

    Article  Google Scholar 

  17. Wang, Z., Bovik, A.C.: Image quality assessment: From error visibility to structural similarity. IEEE Transactions on Image Processing 13(4), 600–612 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Techno India, Salt Lake, Kolkata, India

    Tapasi Bhattacharjee

  2. National Institute of Technology Patna, Bihar, India

    Jyoti Prakash Singh

Authors
  1. Tapasi Bhattacharjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jyoti Prakash Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Gautam Buddha University, Greater Noida, 201310, India

    Karan Singh  & Amit K. Awasthi  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2013 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Bhattacharjee, T., Singh, J.P. (2013). Secret Image Sharing Scheme Based on Pixel Replacement. In: Singh, K., Awasthi, A.K. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2013. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37949-9_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-37949-9_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-37948-2

  • Online ISBN: 978-3-642-37949-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation