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.

scholarly journals A Common General Access Structure Construction Approach in Secret Image Sharing

2020 ◽  
Vol 12 (3) ◽  
pp. 96-110
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu
Keyword(s):  
Secret Sharing ◽  
Access Structure ◽  
Secret Image Sharing ◽  
Visual Secret Sharing ◽  
Pixel Expansion ◽  
Linear Congruence ◽  
Secret Image ◽  
Image Sharing ◽  
General Access Structure ◽  
Special Case

(k, n) threshold is a special case of the general access structure (GAS) in secret image sharing (SIS), therefore GAS is more extensive than (k, n) threshold. Most of conventional SIS, including visual secret sharing (VSS), polynomial-based SIS, linear congruence (LC)-based SIS, etc., were proposed with only (k, k) threshold or (k, n) threshold other than GAS. This article introduces a common GAS construction approach in SIS with on pixel expansion from existing (k, k) threshold or (k, n) threshold SIS. The authors input classic SIS methods to test the efficiency and feasibility of the proposed common GAS construction approach. Experiments are presented to indicate the efficiency of the approach by illustrations and analysis.

scholarly journals Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1582
Author(s):  
Hongliang Cai ◽  
Dan Tang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Access Structure ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
General Access Structure ◽  
Multi Secret Sharing ◽  
Secret Image Sharing Scheme

A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex algebraic-based methods, which can realize the sharing of multi secret images. However, the existing Boolean-based multi secret sharing schemes are mostly restricted to the particular case of (2, n) and (n, n), only few Boolean-based multi secret sharing schemes study the general access structure, and the shares are mostly meaningless. In this paper, a new Boolean-based multi secret sharing scheme with the general access structure is proposed. All the shares are meaningful, which can avoid attracting the attention of adversaries, and the secret images can be recovered in a lossless manner. The feasibility of the scheme is proven, the performance is validated by the experiments on the gray images, and the analysis of the comparison with other methods is also given out.

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.

Sign in / Sign up

Export Citation Format

Share Document