Random-Grid Based Region Incrementing Visual Secret Sharing

• Autorzy: Kumar S. , Sharma R. K.

Identyfikatory

DOI

10.3233/FI-2015-1185

• Języki publikacji: EN

Abstrakty

EN

The concept of region incrementing in visual cryptography was introduced to encrypt an image into multiple secrecy levels. But, it suffers from the pixel expansion increasing exponentially as the number of participants grows. In this paper, we propose a region incrementing visual secret sharing (RIVSS) scheme based on random grids. The proposed scheme is a general (k, n)-RIVSS scheme, in which any t (k ≤ t ≤ n) shares can be used to reconstruct the secret regions up to t − k + 1 levels. However, no information about the input image can be revealed by any k − 1 or fewer shares. With a nice property of region incrementing, the proposed scheme benefits by sharing an image without any pixel expansion and codebook requirement. We give formal proofs and experimental results to confirm both correctness and feasibility of our scheme.

Słowa kluczowe

EN

visual secret sharing; visual cryptography; region incrementing; random grids

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2015
• Tom: Vol. 137, nr 3
• Strony: 369--386
• Opis fizyczny: Bibliogr. 25 poz., rys., tab.

Twórcy

autor

Kumar S.

• Department of Mathematics Indian Institute of Technology Delhi Hauz Khas, New Delhi - 110016, India

autor

Sharma R. K.

• Department of Mathematics Indian Institute of Technology Delhi Hauz Khas, New Delhi - 110016, India

Bibliografia

• [1] G. R. Blakley. Safeguarding cryptographic keys. AFIPS Conference Proceedings, 48:313–317, 1979.
• [2] K. Y. Chao and J. C. Lin. 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.
• [3] T. H. Chen and K. H. Tsao. Visual secret sharing by randomgrids revisited. Pattern Recognition, 42(9):2203–2217, 2009.
• [4] T. H. Chen and K. H. Tsao. Threshold visual secret sharing by random grids. Journal of Systems and Software, 84(7):1197–1208, 2011.
• [5] T. H. Chen and C. S. Wu. Efficient multi-secret image sharing based on boolean operations. Signal Processing, 91(1):90–97, 2011.
• [6] O. Kafri and E. Keren. Encryption of pictures and shapes by random grids. Optics Letters, 12(6):377–379, 1987.
• [7] S. Kumar and R. K. Sharma. Improving contrast in random grids based visual secret sharing. International Journal of Security and its Applications, 6(1):9–28, 2012.
• [8] S. Kumar and R. K. Sharma. Recursive information hiding of secrets by random grids. Cryptologia, 37(2):154–161, 2013.
• [9] S. Kumar and R. K. Sharma. Secret image sharing for general access structures using random grids. International Journal of Computer Applications, 83(7):1–8, 2013.
• [10] S. Kumar and R. K. Sharma. Threshold visual secret sharing based on boolean operations. Security and Communication Networks, 7(3):653–664, 2014.
• [11] D. L. Lau and G. R. Arce. Modern Digital Halftoning. Marcel Dekker, New York, 2000.
• [12] M. Naor and A. Shamir. Visual cryptography. In Proceedings of Advances in Cryptology (EUROCRYPT 94), volume 950, pages 1–12. LNCS, Springer-Verlag, 1995.
• [13] A. Shamir. How to share a secret. Communication of the ACM, 22(11):612–613, 1979.
• [14] S. J. Shyu. Image encryption by random grids. Pattern Recognition, 40(3):1014–1031, 2007.
• [15] S. J. Shyu. Image encryption by multiple random grids. Pattern Recognition, 42(7):1582–1596, 2009.
• [16] S. J. Shyu. Visual cryptograms of random grids for general access structures. IEEE Transactions On Circuits And Systems For Video Technology, 23(3):414–424, 2013.
• [17] S. J. Shyu and H. W. Jiang. Efficient construction for region incrementing visual cryptography. IEEE Transactions On Circuits And Systems For Video Technology, 22(5):769–777, 2012.
• [18] R. Ulichney. Digital Halftoning. The MIT Press, Cambridge, 1987.
• [19] R. Ulichney. A review of halftoning techniques. SPIE, 3963:378–391, 2000.
• [20] D. Wang, L. Zhang, N. Ma, and X. Li. Two secret sharing schemes based on boolean operations. Pattern Recognition, 40(10):2776–2785, 2007.
• [21] R. Z. Wang. Region incrementing visual cryptography. IEEE Signal Processing Letters, 16(8):659–662, 2009.
• [22] R. Z. Wang, Y. C. Lan, Y. K. Lee, S. Y. Huang, S. J. Shyu, and T. L. Chia. Incrementing visual cryptography using random grids. Optics Communications, 283(21):4242–4249, 2010.
• [23] X. Wu and W. Sun. Random grid-based visual secret sharing for general access structures with cheatpreventing ability. Journal of Systems and Software, 85(5):1119–1134, 2012.
• [24] C. N. Yang, H.W. Shih, C. C.Wu, and L. Harn. k out of n region incrementing scheme in visual cryptography. IEEE Transactions On Circuits And Systems For Video Technology, 22(5):799–810, 2012.
• [25] G. S. Zhong and J. J. Wang. Region incrementing visual secret sharing scheme based on random grids. In ISCAS, pages 2351–2354, 2013.