Skip to main content
SpringerLink
Log in

Hierarchical threshold secret sharing scheme for color images

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

The applications that use pattern recognition via secret sharing are seldom linear, straightforward and uncomplicated. The layers of complexity grows as the process turns more secretive. In applications, such as banking transactions, hierarchical secret sharing comes in as a handy tool. This paper analyses the use of disjunctive hierarchy of secret sharing without compromising security while saving time. This scheme simplifies the process when more hands are involved by using simple Boolean and arithmetic operations and thus reduces the computational complexity from O (nlog2n) to O (n). The other features are authentication of the participants using Lagrange Interpolation; non-requirement of half toning of color images; no pixel expansion without degradation in visual quality of the recovered secret image. This paper also provides solution for meaningful share images with the ability to detect the manipulation of share images. The main advantage of this scheme is that it gives the benefit in scenarios in which participants of different levels are involved.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Blakley GR (1979) Safeguarding cryptographic keys. National Computer Conference, American Federation of Information Processing Societies Proceedings, 48:313–317

  2. Brickell EF (1989) Some ideal secret sharing schemes. J Comb Math Comb Comput 6:105–113

    MathSciNet  MATH  Google Scholar 

  3. Brickell EF, Davenport DM (1991) On the classification of ideal secret sharing schemes. J Cryptol 4(2):123–134

    Article  MATH  Google Scholar 

  4. Chang C, Hsieh Y, Lin C (2008) Sharing secrets in stego images with authentication. Pattern Recogn 41:3130–3137

    Article  MATH  Google Scholar 

  5. Cheng G, Chang CC, Qin C (2012) A hierarchical threshold secret image sharing. Pattern Recogn Lett 33:83–91

    Article  Google Scholar 

  6. Eslami Z, Razzaghi SH, Ahmadabadi JZ (2010) Secret image sharing based on cellular automata and steganography. Pattern Recogn 43:397

    Article  MATH  Google Scholar 

  7. Mohamed Fathimal P, Arockia Jansi Rani P (2014) K out of N secret sharing scheme for gray and color images. IEEE Int Conf Electr, Comput Commun Technol 1–4 doi:10.1109/ICECCT.2015.7226019

  8. Mohamed Fathimal P, Arockia Jansi Rani P (2014) Bidirectional serpentine scan based error diffusion technique for color image visual cryptography. Int J Sci Eng Technol Res 3(9):2255–2260

    Google Scholar 

  9. Mohamed Fathimal P, Arockia Jansi Rani P (2015) (N, N) secret color image sharing scheme with dynamic group. Int J Comput Netw Inf Secur 7(7):46–52

    Google Scholar 

  10. Mohamed Fathimal P, Arockia Jansi Rani P (2015) Threshold based region incrementing scheme for color images. Int J Comput, Electr, Autom Control Inf Eng 9(8):2015

    Google Scholar 

  11. Mohamed Fathimal P, Rani AJ (2015) Design of block based visual secret sharing scheme for color images. Int J Appl Eng Res 10(33):26087–26091

    Google Scholar 

  12. Mohamed Fathimal P, Rani PAJ (2015) K out of N secret sharing scheme for color images with steganography and authentication. Advances in Intelligent Systems and Computing, Springer, pp. 413–425

  13. Mohamed Fathimal P, Rani PAJ (2015) K out of N secret sharing scheme for multiple color images with steganography and authentication. Int J Imaging Graph, World Sci 16(2). doi:10.1142/S0219467816500108

  14. Naor M, Shamir A (1995) Visual cryptography. Proc. Advances in Cryptography (EUROCRYPT’94),LNCS, 950:1–12

  15. Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613

    Article  MathSciNet  MATH  Google Scholar 

  16. Simmons GJ (1988) How to (really) share a secret. In: Proc. CRYPTO 1988, LNCS, 403:390–448

  17. Tassa T (2007) Hierarchical threshold secret sharing. J Cryptol 20(2):237–264

    Article  MathSciNet  MATH  Google Scholar 

  18. Tassa T, Dyn N (2009) Multipartite secret sharing by bivariate interpolation. J Cryptol 22(2):227–258

    Article  MathSciNet  MATH  Google Scholar 

  19. Yang C-N, Ouyang J-F, Harn L (2012) Steganography and authentication in image sharing without parity bits. Opt Commun 285:1725–1735

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, SRM University, Vadapalani Campus, Chennai, Tamilnadu, India

    Mohamed Fathimal P

  2. Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, Tamilnadu, India

    Arockia Jansi Rani P

Authors
  1. Mohamed Fathimal P
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arockia Jansi Rani P
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed Fathimal P.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mohamed Fathimal P, Arockia Jansi Rani P Hierarchical threshold secret sharing scheme for color images. Multimed Tools Appl 76, 5489–5503 (2017). https://doi.org/10.1007/s11042-016-4074-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-4074-y

Keywords

Search

Navigation