Random Matrices Based Image Secret Sharing

Jyoti Prakash Singh, Amitava Nag, Tapasi Bhattacharjee

Abstract


This paper presents an image secret sharing method based on some random matrices that acts as a key for secret sharing. The technique allows a secret image to be divided into four image shares with each share individually looks meaningless. To reconstruct the secret image all four shares have to be used. Any subset m (1< m ≤ 4) shares cannot get sufficient information to reveal the secret image. The share generation algorithm works by converting three pixels of the secret image to one pixel each of four different shares based on four random matrices. So, each share is reduced by 1/3rd of the original secret image. During reconstruction, one pixel of each shares are used to reconstruct three pixels of original secret image using the same set of random matrices by image reconstruction algorithm. Our method of share generation is an effective, reliable, and secure method to prevent the secret image. The advantages of this approach in comparison with other image secret sharing methods are its large compression rate on the size of the image shares, its strong protection of the secret image and its ability for real time processing.

 

 

Keywords: Secret Sharing; threshold cryptography; shadow images; security


Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v2i4.597

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science