Visual Secret Sharing Without Pixel Expansion

Visual Secret Sharing Without Pixel Expansion

Ali Makki Sagheer (Information Systems Department, University of Anbar, Ramadi, Iraq) and Laith Hamid Abed (Computer Systems Department, Anbar Technical Institute, Middle Technical University, Fallujha, Anbar, Iraq)
Copyright: © 2015 |Pages: 11
DOI: 10.4018/IJDCF.2015040102
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Visual Secret Sharing (VSS) is a powerful approach for protecting image sharing through unsecured computer network such as the Internet. Pixel expansion and bad image quality are the most common problems of this approach. Visual secret sharing technique is proposed for grayscale images to eliminate pixel expansion problem using image compression. The experimental results and security analysis illustrate that the proposed visual secret sharing technique leads to better results in terms of image security and quality together with pixel expansion's elimination. The obtained results showed that the accomplished image security is stronger than the security of the traditional secret sharing technique as the secret key encryption is associated with VSS approach.
Article Preview

Shamir secret sharing scheme of Galois is used to generate protected shares and reduce the pixel expansion problem. Chang-Chou and Wen-Hsiang introduce a (2, 3)-threshold visual secret sharing technique in 2003 where secret image was reconstructed by gathering any two of the three shares. Good experimental results prove that this technique is suitable for mobile and handheld devices applications (Lin and Tsai, 2003). (Adel, 2005) present a watermarking system based on visual secret sharing approach. (Kun-Yuan and Ja-Chen, 2006) present a (2, 3)-threshold visual secret sharing system for color images. The system converts the input image into Cyan Magenta Yellow (CMY) color model. Each layer of CMY is transformed from 8-bit to 1-bit by halftone algorithm which is either 0 or 1. The visual secret sharing is achieved by another method which differs from Naor-Shamir method. The experimental results explain the limitation according to the large pixel expansion and bad image quality or contrast.

(Chin-Pan and Ching-Chung, 2007) propose a (4, 6)-threshold secret image sharing method using integer wavelet transform and Shamir secret sharing scheme of Galois filed. This method processes the transformed coefficients in each sub-band to be combined with each other and divides each of the resulting combination coefficients into number of shares. The experimental results show that this method yields small shares and it is suitable for online applications and perfect reconstruction of secret image.

At the same time, the individual protected shares do not reveal the identity of the original image (Arun and Asem, 2010). The results confirm that private face image is camouflaged to two secured shares and the face image is matched successfully.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing