scholarly journals Fourier-Based Function Secret Sharing with General Access Structure

2018 ◽  
pp. 417-428 ◽  
Author(s):  
Takeshi Koshiba
Keyword(s):  
Secret Sharing ◽  
Access Structure ◽  
General Access Structure

Realizing secret sharing with general access structure

2016 ◽  
Vol 367-368 ◽  
pp. 209-220 ◽  
Author(s):  
Lein Harn ◽  
Chingfang Hsu ◽  
Mingwu Zhang ◽  
Tingting He ◽  
Maoyuan Zhang
Keyword(s):  
Secret Sharing ◽  
Access Structure ◽  
General Access Structure

Visual multiple-secret sharing for flexible general access structure by random grids

Displays ◽  
2015 ◽  
Vol 39 ◽  
pp. 80-92 ◽  
Author(s):  
Kai-Hsiang Tsao ◽  
Shyong-Jian Shyu ◽  
Chih-Hung Lin ◽  
Yao-Sheng Lee ◽  
Tzung-Her Chen
Keyword(s):  
Secret Sharing ◽  
Access Structure ◽  
Random Grids ◽  
General Access Structure

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.

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.

Sign in / Sign up

Export Citation Format

Share Document