Advertisement

A Fast and Hardware-Efficient Visual Cryptography Scheme for Images

  • Dipesh Vaya
  • Sarika Khandelwal
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 379)

Abstract

Shamir’s encryption method is to share a secret image by n number of shadow images and then r shadow images can be used to obtain the original secret image. In proposed method, the size of secret image is greater than the size of the shadow image used for the encryption. Such shadow image is beneficial to process in image hiding, transmission, or storage. For this purpose Shamir’s encryption technique is used in this proposed work. In Shamir’s encryption technique, author used the equation to encrypt the data into multiple parts. In the equation, time required for the multiplication and division of the input components of the data is more than addition and subtraction. Hence, the encryption time is little bit high. To reduce this encryption and decryption time, Shamir’s equation is modified by converting all the multiplication part into addition and division parts into subtraction in this proposed work.

Keywords

Secret sharing Lossless reveal Shadow images Shamir’s encryption technique 

References

  1. 1.
    Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings AFIPS 1979 National Computer Conference, vol. 48, pp. 313–7. New York, USA, 4–7 June 1979Google Scholar
  2. 2.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Ahlswede, R., Csiszár, I.: Common randomness in information theory and cryptography-part I: secret sharing. IEEE Trans. Inf. Theory 39(4), 1121–32 (1993)Google Scholar
  4. 4.
    Beimel, A., Chor, B.: Secret sharing with public reconstruction. IEEE Trans. Inf. Theory 44(5), 1887–1896 (1998)MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Beimel, A., Chor, B.: Universally ideal secret-sharing schemes. IEEE Trans. Inf. Theory 40(3), 786–794 (1994)MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Stinson, D.R.: Decomposition constructions for secret-sharing schemes. IEEE Trans. Inf. Theory 40(1), 118–124 (1994)MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Thien, C.-C., Jin, J.-C.: Secret image sharing. Comput. Graph. 26, 765–770 (2002)Google Scholar
  8. 8.
    Abdelsatir, E.-T.B., Salahaldeen, S., Omar, H., Hashim, A.: A novel (K, N) secret sharing scheme from quadratic residues for grayscale images” Int. J. Netw. Secur. Appl. (IJNSA) 6(4), 65–72 (2014)Google Scholar
  9. 9.
    Chen, C.-C., Chang, C.-C.: Secret image sharing using quadratic residues. Intell. Inf. Hiding Multimedia Sig. Process. (IIHMSP) 1, 515–518 (2007)Google Scholar
  10. 10.
    Patil, S., Rao, J.: Extended visual cryptography for color shares using random number generators. Int. J. Adv. Res. Comput. Commun. Eng. 1(6) (2012)Google Scholar
  11. 11.
    Kalai Selvi, A., Mohamed Sathik, M.: Secret sharing scheme for image encryption based on primitive root theorem. Int. J. Control Autom 5(3), 37 (2012)Google Scholar
  12. 12.
    Thakur, M., Ashraf, J.: Design of braun multiplier with Kogge Stone Adder & it’s implementation on FPGA. Int. J. Sci. Eng. Res. 3(10) (2012)Google Scholar
  13. 13.
    Seng, Y.K. Roy, K.: Low Voltage, Low Power VLSI Subsystems. TMC (2009)Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer Science & EngineeringGeetanjali Institute of Technical StudiesUdaipurIndia

Personalised recommendations