Random Grid and Reversible Watermarking-Based On Verifiable Secret Sharing for Outsourcing Images in Cloud

2018 ◽  
Vol 10 (1) ◽  
pp. 24-39 ◽  
Author(s):  
Hang Gao ◽  
Mengting Hu ◽  
Tiegang Gao ◽  
Renhong Cheng
Keyword(s):  
Secret Sharing ◽  
Reversible Watermarking ◽  
Initial Value ◽  
Verifiable Secret Sharing ◽  
Authorized User ◽  
Secret Image ◽  
Data Owner ◽  
Xor Operation ◽  
Random Grid ◽  
Cloud Server

A novel random grid and reversible watermarking based verifiable secret sharing scheme for outsourcing image in cloud is proposed in the paper. In the proposed scheme, data owner firstly embeds the hash value of the secret image into the secret image itself using reversible watermarking algorithm; then, watermarked image is divided into $n$ sub image. Secondly, the hash of n sub image is calculated, and then the hash value is transformed into the initial value of hyper-chaos, thus n random grids are generated by different hyper-chaos. Lastly, after expanding the sub-image to the same size with the original secret image, it is performer XOR operation with the corresponding random grid, this will accordingly produce $n$ sharing secret. In order to securely outsource the image in the cloud, the generated shares are issued to the $n$ different cloud server. For authorized user, (s)he can get shares from different cloud server, and then can recover the original secret image through a series of decryption operations and extraction of reversible watermarking. The proposed scheme can losslessly restore the original secret image, and have the double verification ability, that is to say, it can verify whether the anyone of the sharing is modified, and it can also verify whether the original secret image is completely reconstructed. Some analysis and comparisons are given to show the security and effectiveness of proposed scheme.

Image Secret Sharing Construction for General Access Structure with Meaningful Share

2018 ◽  
Vol 10 (3) ◽  
pp. 66-77 ◽  
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Duohe Ma
Keyword(s):  
Secret Sharing ◽  
Cloud Storage ◽  
Access Structure ◽  
Visual Secret Sharing ◽  
Secret Image ◽  
General Access Structure ◽  
Image Secret Sharing ◽  
Random Grid ◽  
Meaningful Share

This article describes how the (k, n) threshold image secret sharing technology can recover the secret image even n − k shares are lost, or n−k servers do not work, which is useful for cloud storage, etc. Image secret sharing for general access structure (GAS) is more general than (k, n) threshold. Image secret sharing with a meaningful share will decrease encryption suspicion so that the security can be enhanced. However, traditional studies have no image secret sharing construction approach for GAS with a meaningful share. In the article, they first exploit an image secret sharing construction approach for GAS with meaningful share. Following their construction approach, the authors develop a random grid (RG)-based visual secret sharing (VSS) algorithm for GAS with meaningful share as well as polynomial-based image secret sharing for GAS with meaningful share. The experiments with this concept exhibit the effectiveness of the algorithms and further their construction approach.

LOSSLESS SECRET SHARING SCHEME WITH HIGH QUALITY SHARES BASED ON VQ-COMPRESSED IMAGES

2011 ◽  
Vol 25 (04) ◽  
pp. 529-546
Author(s):  
CHIN-CHEN CHANG ◽  
KUO-NAN CHEN ◽  
NGOC-TU HUYNH
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Compression Method ◽  
Pixel Expansion ◽  
High Quality ◽  
Secret Image ◽  
Compressed Images ◽  
Sharing Scheme ◽  
Xor Operation

In this paper, we propose an efficient secret sharing scheme without pixel expansion. The scheme first uses the VQ-compression method to compress a secret image. This allows senders to share a larger secret image than other methods. Moreover, the proposed method also allows participants to reconstruct a lossless secret image. The generated shadows are meaningful with high quality, so the image does not attract any suspicion from attackers. Because the scheme uses XOR operation during the construction and revealing phases, it is suitable for secret sharing applications.

scholarly journals VISUAL CRYPTOGRAPHY FOR COLOR IMAGES

2013 ◽  
pp. 147-149
Author(s):  
ASHWATHIMESANGLA AO
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Color Images ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Secret Information ◽  
Host Image ◽  
Sharing Scheme ◽  
Visual Cryptography Scheme

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.

Sign in / Sign up

Export Citation Format

Share Document