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.
Similar content being viewed by others
References
Blakley GR (1979) Safeguarding cryptographic keys. National Computer Conference, American Federation of Information Processing Societies Proceedings, 48:313–317
Brickell EF (1989) Some ideal secret sharing schemes. J Comb Math Comb Comput 6:105–113
Brickell EF, Davenport DM (1991) On the classification of ideal secret sharing schemes. J Cryptol 4(2):123–134
Chang C, Hsieh Y, Lin C (2008) Sharing secrets in stego images with authentication. Pattern Recogn 41:3130–3137
Cheng G, Chang CC, Qin C (2012) A hierarchical threshold secret image sharing. Pattern Recogn Lett 33:83–91
Eslami Z, Razzaghi SH, Ahmadabadi JZ (2010) Secret image sharing based on cellular automata and steganography. Pattern Recogn 43:397
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
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
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
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
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
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
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
Naor M, Shamir A (1995) Visual cryptography. Proc. Advances in Cryptography (EUROCRYPT’94),LNCS, 950:1–12
Shamir A (1979) How to share a secret. Commun ACM 22(11):612–613
Simmons GJ (1988) How to (really) share a secret. In: Proc. CRYPTO 1988, LNCS, 403:390–448
Tassa T (2007) Hierarchical threshold secret sharing. J Cryptol 20(2):237–264
Tassa T, Dyn N (2009) Multipartite secret sharing by bivariate interpolation. J Cryptol 22(2):227–258
Yang C-N, Ouyang J-F, Harn L (2012) Steganography and authentication in image sharing without parity bits. Opt Commun 285:1725–1735
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-016-4074-y