scholarly journals Adaptive Partial Image Secret Sharing

Symmetry ◽  
2020 ◽  
Vol 12 (5) ◽  
pp. 703
Author(s):  
Xuehu Yan ◽  
Lei Sun ◽  
Yuliang Lu ◽  
Guozheng Yang
Keyword(s):  
Secret Sharing ◽  
Image Inpainting ◽  
Batch Processing ◽  
Linear Congruence ◽  
Secret Image ◽  
Meaningful Shares ◽  
Image Secret Sharing

In contrast to encrypting the full secret image in classic image secret sharing (ISS), partial image secret sharing (PISS) only encrypts part of the secret image due to the situation that, in general, only part of the secret image is sensitive or secretive. However, the target part needs to be selected manually in traditional PISS, which is human-exhausted and not suitable for batch processing. In this paper, we introduce an adaptive PISS (APISS) scheme based on salience detection, linear congruence, and image inpainting. First, the salient part is automatically and adaptively detected as the secret target part. Then, the target part is encrypted into n meaningful shares by using linear congruence in the processing of inpainting the target part. The target part is decrypted progressively by only addition operation when more shares are collected. It is losslessly decrypted when all the n shares are collected. Experiments are performed to verify the efficiency of the introduced scheme.

scholarly journals Digital Image Secure Share Creation Techniques Analysis

2019 ◽  
Vol 9 (1S3) ◽  
pp. 510-513
Keyword(s):  
Digital Image ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Random Model ◽  
Security Measures ◽  
Digital Form ◽  
Secret Image ◽  
Image Secret Sharing ◽  
Shamir Secret Sharing ◽  
The Web

Security is a significant concern in data innovation that managing the web world today. In sharing based technique shares are created, encoded and stored into digital form. This paper discussed the various papers in secret share creation for image security like visual secret share creation, Chinese remainder theorem, Shamir secret sharing and so on. In this design, a secret image is programmed into n shadows of the random model. It is possible to interpret the secret image externally by overlay a certified subset of shadows. These shares are uncovering the secret image to assume to be imprinted on transparencies and in the wake of stacking them to one another. Here more than fifteen papers are analyzed; those papers are gathered from IEEE, Springer, Elsevier and some other Journals. In addition, security measures are analyzed for all image secret sharing procedure.

scholarly journals Image inpainting-based behavior image secret sharing

2020 ◽  
Vol 17 (4) ◽  
pp. 2950-2966
Author(s):  
Xuehu Yan ◽  
◽  
Xuan Zhou ◽  
Yuliang Lu ◽  
Jingju Liu ◽  
...  
Keyword(s):  
Secret Sharing ◽  
Image Inpainting ◽  
Image Secret Sharing

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 An Image Secret Sharing Method Based on Matrix Theory

Symmetry ◽  
2018 ◽  
Vol 10 (10) ◽  
pp. 530 ◽  
Author(s):  
Wanmeng Ding ◽  
Kesheng Liu ◽  
Xuehu Yan ◽  
Huaixi Wang ◽  
Lintao Liu ◽  
...  
Keyword(s):  
Secret Sharing ◽  
Matrix Theory ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Image Secret Sharing ◽  
Special Case ◽  
Secret Image Sharing Scheme

Most of today’s secret image sharing technologies are based on the polynomial-based secret sharing scheme proposed by shamir. At present, researchers mostly focus on the development of properties such as small shadow size and lossless recovery, instead of the principle of Shamir’s polynomial-based SS scheme. In this paper, matrix theory is used to analyze Shamir’s polynomial-based scheme, and a general (k, n) threshold secret image sharing scheme based on matrix theory is proposed. The effectiveness of the proposed scheme is proved by theoretical and experimental results. Moreover, it has been proved that the Shamir’s polynomial-based SS scheme is a special case of our proposed scheme.

Improved Extended Progressive Visual Cryptography Scheme Using Pixel Harmonization

2021 ◽  
Vol 15 (2) ◽  
pp. 196-216
Author(s):  
Suhas Bhagate ◽  
Prakash J. Kulkarni
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Schemes ◽  
Pixel Expansion ◽  
Secret Image ◽  
Secret Information ◽  
Meaningful Shares ◽  
Visual Cryptography Scheme

Security of information is of much concern in the modern internet era. Secret sharing schemes provide mechanism of encrypting secret information to prevent illicit usage. Visual cryptography is a secret sharing technique that facilitates encryption of a secret image. Visual cryptography allows us to effectively and efficiently share secrets among a number of trusted parties by hiding secrets within images. These images are encoded into multiple shares as per the rules indicated in basis matrices and later decoded by stacking required number of shares. Progressive visual cryptography has a specialty of recovering secret image as soon as more than one shares received gradually. Existing progressive visual cryptography schemes have severe limitations like data disclose on shares and higher pixel expansion. Improved progressive visual cryptography scheme deals with these limitations. Improved extended progressive visual cryptography scheme solves the issue of management of noise like meaningless shares by creating meaningful shares without any pixel expansion efficiently.

scholarly journals Improvements in Geometry-Based Secret Image Sharing Approach with Steganography

2009 ◽  
Vol 2009 ◽  
pp. 1-11 ◽  
Author(s):  
Mustafa Ulutas ◽  
Vasif V. Nabiyev ◽  
Guzin Ulutas
Keyword(s):  
Secret Sharing ◽  
The Internet ◽  
Secret Sharing Scheme ◽  
Secret Image Sharing ◽  
Sensitive Data ◽  
Secret Image ◽  
Meaningful Shares ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Fast Development

Protection of the sensitive data is an important issue because of the fast development of applications that need exchange of the secret information over the Internet. Secret sharing is an idea proposed by Shamir and Blakley separately with different implementations in 1979. Lin and Tsai proposed a method that uses Steganography to create meaningful shares by using Shamir's secret sharing scheme in 2004. In recent years, researchers work to remove some of the weaknesses of this method. However, all of these methods need cover images four times bigger than the secret image. This arises two problems: increased storage and bandwidth need for shares. We used cover images with the same size as the secret image by using both Blakley's secret sharing approach and Steganography. Therefore, we achieved reduced storage and transmission bandwidth for shares. Besides, the proposed method creates meaningful shares by using Steganography instead of noise-like shares, different from other studies that use Blakley's 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.

Sign in / Sign up

Export Citation Format

Share Document