Call for Paper - January 2023 Edition
IJCA solicits original research papers for the January 2023 Edition. Last date of manuscript submission is December 20, 2022. Read More

Ideal Contrast Secret Sharing Scheme Through Meaningful Shares with Enveloping Digital Watermarking using Bit Plane based (k,n)-VCS

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 46 - Number 9
Year of Publication: 2012
Authors:
Aarti
Harsh K Verma
Pushpendra K Rajput
10.5120/6941-9400

Aarti, Harsh K Verma and Pushpendra K Rajput. Article: Ideal Contrast Secret Sharing Scheme Through Meaningful Shares with Enveloping Digital Watermarking using Bit Plane based (k,n)-VCS. International Journal of Computer Applications 46(9):36-41, May 2012. Full text available. BibTeX

@article{key:article,
	author = {Aarti and Harsh K Verma and Pushpendra K Rajput},
	title = {Article: Ideal Contrast Secret Sharing Scheme Through Meaningful Shares with Enveloping Digital Watermarking using Bit Plane based (k,n)-VCS},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {46},
	number = {9},
	pages = {36-41},
	month = {May},
	note = {Full text available}
}

Abstract

Visual Cryptography Scheme (VCS) is an encryption method that works on human visual system. It encrypts a secret image into n shares and decryption can be done only by stacking k or more share images without any computation. A new secret sharing scheme with meaningful shares using (k,n)-threshold visual cryptography and digital watermarking for grayscale images based on bit plane encoding is proposed in this paper, that encrypts a grayscale secret image in such a way that results of encryption is in the form of shares. Shares do not reflect any information directly, information is scrambled instead. Firstly, an image is decomposed into its bit plane images that generate a binary image at each bit plane. Secondly, the traditional binary secret sharing scheme is used to get the sharing images. Finally, a proposed watermarking technique is used to generate meaningful shares. To decrypt hidden secret image, extract the shares from the cover image and decompose each share into bit planes and then secret grayscale image is reconstructed. This scheme provides a more efficient way to hide images in different meaningful shares. Furthermore, the size of the hidden secret can be recovered by inspecting the blocks in the shares.

References

  • Naor, M. and Shamir A, 1995 Visual cryptography, in: A. De Santis (Ed. ), Advances in Cryptology: Eurpocrypt' 94, Lecture Notes in Computer Science, vol. 95, pp. 1–12.
  • Ateniese G. , Blundo C. and Stinson D. R. ,1996 Constructions and bounds for visual cryptography in 23rd International Colloquium on Automata, Languages and Programming, ser. Lecture Notes in Computer Science, F. M. auf der Heide and B. Monien, Eds. , vol. 1099. Berlin: Springer-Verlag, pp. 416-428.
  • Stinson D. R. , 1997 An introduction to visual cryptography, Presented at Public Key Solutions '97, Toronto, Canada, April 28–30.
  • Verheul E. R. , and Van Tilborg H. C. A. , 1997 Constructions and properties of k out of n visual secret sharing schemes, Des. Codes Cryptogr. 11 179–196.
  • Blundo C. , Santis A. D, and Stinson D. R. 1999 On the contrast in visual Cryptography schemes Cryptology 12 261–289.
  • Ateniese G. , Blundo C. , Santis A. D. , and Stinson D. R. 1996 Visual Cryptography for general access structures Inf. Comput. , vol. 129, no. 2, pp. 86–106.
  • Lin C. C. , and Tsai W. -H. 2003 Visual cryptography for grey-level images by dithering techniques in Pattern Recognition Lett. 24 349–358.
  • Shyu S. J. 2006 Efficient visual secret sharing scheme for color images in Pattern Recognition 39 866–880.
  • Wu C. C. , and Chen L. H. 1998. A study on visual cryptography, Master Thesis, Institute of Computer and Information Science in National Chiao Tung University, Taiwan, R. O. C.
  • Wu H. C. , Chang C. C. 2005 Sharing visual multi-secrets using circle shares Comput. Stand. Interfaces 134 (28) 123–135.
  • Poynton C. A. "Frequently asked questions about color", http://www. inforamp. net/? poynton.
  • Zhou Z. 2006 Halftone Visual Cryptography. In IEEE Transactions on image processing, vol. 15, No. 8, .
  • Hou Y. C. 2003 Visual cryptography for color images in Pattern Recognit. , vol. 36, pp. 1619–1629.
  • Chin-Chen Chang, Jun-Chou Chuang,Pei-Yu Lin 2005 Sharing A Secret Two Tone Image In Two Gray Level Images. In Proceedings of the 11th International Conference on Parallel and Distributed Systems (ICPADS'05).
  • Kang I. , Arce G R. , Lee H. K. , 2011 Color Extended Visual Cryptography Using Error Diffusion in IEEE Transactions on image processing, vol. 20, No. 1.
  • Kumari K, and Bhatia S 2010 Multi-pixel Visual Cryptography for color images with Meaningful Shares in International Journal of Engineering Science and Technology vol. 2(6), 2398-2407.
  • Mandal J K, Ghatak S 2011 Secert Image/Message Transmission through Meaningful shares using (2,2) Visual Cryptography (SITMSVC) in IEEE International Conference on Recent Trends in Information Technology, 978-1-4577-0590/11.
  • Lukac R and Plataniotis K. 2005 Bit-level based secret sharing for image encryption in Pattern Recognition, vol. 38, no. 5, pp. 767-772.
  • Chandramouli R, and Menon N. 2011 Analysis of LSB based image steganography Techniques In Proc. Of ICIP, thissaloniki, Greece, pp. 1019-1022.
  • Nameer, N. EL-Emam 2007 Hiding a large amount of data with high security using stegnagraphy algorithm Journal of Computer science ISSN 1549-3636, vol. 3, No. 4,pp. 355-372.