Visual Secret Sharing of Color Image Using Extended Asmuth Bloom Technique

  • L. Jani Anbarasi
  • G. S. Anadha Mala
  • D. R. L. Prassana
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 33)


Secret image sharing is the technique for securing images that involves the distribution of secret image into several shadow images. Secret sharing for color image is proposed in this article using Asmuth bloom technique which is further extended for accurate reconstruction of given original image. The secret image is reduced in pixel value using a quantization factor resulting in quantized secret image and a difference image. Secret shares based on Asmuth Bloom scheme are generated from the quantized secrets and are distributed among n participants specified at least t of them should gather to reveal the difference secret image and therefore the respective quantized image. The original secret is reconstructed using the inverse quantization process.


Image processing Asmuth bloom technique Secret sharing 


  1. 1.
    Abbas, C., Joan, C., Kevin, C., Paul Mc, Kt.: Digital image steganography. Survey and analysis of current methods. Sig. Process 90, 727–752 (2010)CrossRefMATHGoogle Scholar
  2. 2.
    Thien, C.C., Lin, J.C.: Secret image sharing. Comput. Graph. 26, 765–770 (2002)CrossRefGoogle Scholar
  3. 3.
    Tso, H.K.: Sharing secret images using Blakley’s concept. Opt. Eng. 47, 077001 (2008)CrossRefGoogle Scholar
  4. 4.
    Mustafa, U., Güzin, U., Vasif, N.: Medical image security and EPR hiding using Shamir’s secret sharing scheme. J. Syst. Softw. 84, 341–353 (2011)CrossRefGoogle Scholar
  5. 5.
    Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theor. 29, 208–210 (1983)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of AFIPS National Computer Conference, pp. 313–317 (1979)Google Scholar
  7. 7.
    Sorin, I., Ioana, B.: Weighted threshold secret sharing based on the Chinese remainder theorem. Sci. Ann. Cuza Univ. 15, 161–172 (2005)MATHGoogle Scholar
  8. 8.
    Kamer, K., Ali, A.S.: Secret Sharing Extensions Based on Chinese Remainder Theorem, p. 96. IACR Cryptology, (2010)Google Scholar
  9. 9.
    Beimel, A., Tassa, T., Weinreb, E.: Characterizing Ideal Weighted Threshold Secret Sharing. In: Second Theory of Cryptography Conference, pp. 600–619 (2005)Google Scholar
  10. 10.
    Amos, B., EnavWeinre.: Monotone circuits for weighted threshold functions. In: 20th Annual IEEE Conference on Computational Complexity. pp. 67–75 (2005)Google Scholar
  11. 11.
    Guzin, U., Mustafa, U., Vasif, N.: Distortion free geometry based secret image sharing. Procedia Comput. Sci. 3, 721–726 (2011)CrossRefGoogle Scholar
  12. 12.
    Cheng, G., Chin, C.C., Chuan, Q.: A hierarchical threshold secret image sharing. Pattern Recogn. Lett. 33, 83–91 (2012)CrossRefGoogle Scholar
  13. 13.
    Pei-Yu, L., Jung, S.L., Chin, C.C.: Distortion-free secret image sharing mechanism using modulus operator. Pattern Recogn. 42, 886–895 (2009)CrossRefMATHGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  • L. Jani Anbarasi
    • 1
  • G. S. Anadha Mala
    • 2
  • D. R. L. Prassana
    • 3
  1. 1.Sri Ramakrishna Institute of TechnologyCoimbatoreIndia
  2. 2.Easwari College of EngineeringChennaiIndia
  3. 3.Vasavi College of EngineeringHyderabadIndia

Personalised recommendations