Improve Information Rate in Thien and Lin's Image Secret Sharing Scheme Using Huffman Coding Technique

Shares in image secret sharing play a vital role. These image shares has size greater than or equal to size of original image, it require high bandwidth while transmission. Because of the excessive bandwidth requirements of image there is need to reduce the bandwidth of images. To reduce the size of image, Huffman compression coding techniques are used. By reducing the image share size in Thien and Lin's secret sharing scheme using Huffman coding technique leads to reduced bandwidth overhead. In proposed approach Huffman coding is applied on secret image before applying secret sharing. This approach helps to increase the compression ratio of share images by 14 % than existing system.