Visual Cryptography Method for Sending Multiple Shares Using Symmetric Encryption Algorithm

Authors

  • B. Divya  Research Scholar, Department of Computer Science, A.V.C College, Mayiladuthurai, India
  • D. Sudha  Associate Professor, Department of Computer Science, A.V.C College, Mayiladuthurai, India

Keywords:

XOR Algorithm, Visual Cryptography, Multi Secret Sharing, Secured Communication, Pixel Expansion

Abstract

An image can be splitted into two random shares which once individually viewed reveals no idea about the secret picture. The secret image can be obtained by union of the two shares. This method is known as Visual Cryptography. Conventional k out of n visual cryptography scheme is used to encrypt a solitary picture into n shares. The image can be decoded by using only k or more shares. Many existing illustration cryptographic methods uses binary images only for this process. This doesn’t suits well for many applications. The main objective of this project is to establish message among the sender and the receiver by using emails and other communicating modes. In this work, an XOR based multi secret sharing is proposed to send images from the source to the destination in a secured way. This method eliminates the fundamental safety challenges of VC which is similar to secondary use of code book, random split patterns, expansion of pixels in collective and enhanced images, lossy recovery of secret images and limitation on number of shares. The proposed method is n out of n multi secret sharing method. Broadcast of several secret images at the same time is accomplished through this planned project. The secret picture can be uncovered only when each and every one of the n shares are accepted by the receiver and decrypted. Master share is formed at time of encryption by using a secret key and can be regenerated by using the same secret key at the instance of decryption. Experimental results show that the pixel standards of the secret images received at the destination is very elevated when compared to the available methodologies.

References

  1. Ateniese, C. Blundo, A. D. Santis and D. R. Stinson (2001) "Extended capabilities for visual cryptography," Theoretical Computer Science, vol. 250, no. 1-2, pp. 143-161.
  2. Beimel and I. Orlov (2011) "Secret sharing and non-shannon information inequalities," IEEE Transactions on Information Theory, vol. 57, no. 9, pp. 5634-5649.
  3. Bose and R. Mukerjee (2010) "Optimal (k, n) visual cryptographic schemes for general k," Designs, Codes and Cryptography, vol. 55, no. 1, pp. 19-35.
  4. Farras, T. Hansen, T. Kaced and C. Padro (2014) "Optimal non-perfect uniform secret sharing schemes," in Proceedings of Advances in Cryptology - Crypto 2014, ser. Lecture Notes in Computer Science, vol. 8617. Springer-Verlag, pp. 217-234.
  5. Sasaki and Y. Watanabe (2014) "Formulation of visual secret sharing schemes encrypting multiple images," in Proceedings of the 39th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2014). IEEE, pp. 7391-7395.
  6. Washio and Y. Watanabe (2014) "Security of audio secret sharing scheme encrypting audio secrets with bounded shares," in Proceedings of the 39th IEEE International Conference on Acoustics, Speech & Signal Processing (ICASSP 2014). IEEE, pp. 7396-7400.
  7. Kai-Hui Lee & Pei -Ling Chiu (2011) "A high contrast and capacity efficient visual cryptography scheme for the encryption of multiple secret images", Optics Communications, June, Volume 284, Issue 12, p. 2730-2741.
  8. C. Chen (2017) "Fully incrementing visual cryptography from a succinct non - monotonic structure," IEEE Transactions on Information Forensics and Security, May vol. 12, no. 5, pp. 1082-1091.
  9. N. Yang and T.H. Chung (2010) "A general multi-secret visual cryptography scheme," Optics Communications, vol. 283, no. 24, pp. 4949-4962.
  10. J. Shyu (2014) "Threshold visual cryptographic scheme with meaningful shares," IEEE Signal Processing Letters, vol. 21, no. 12, pp. 1521-1525.
  11. Chen T-H, Wu C-S (2011) Efficient multi-secret image sharing based on Boolean operations. Signal Process 91.1:90-97.
  12. Taghaddos D, Latif A (2014) Visual cryptography for gray-scale images using bit-level. In: Journal of information hiding and multimedia signal processing, ubiquitous international, vol 5(1), pp 90-98.

Downloads

Published

2018-10-30

Issue

Section

Research Articles

How to Cite

[1]
B. Divya, D. Sudha, " Visual Cryptography Method for Sending Multiple Shares Using Symmetric Encryption Algorithm, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 7, pp.282-288, September-October-2018.