Greyscale-images-oriented progressive secret sharing based on the linear congruence equation

2017 ◽  
Vol 77 (16) ◽  
pp. 20569-20596 ◽  
Author(s):  
Lintao Liu ◽  
Yuliang Lu ◽  
Xuehu Yan ◽  
Huaixi Wang
Keyword(s):  
Secret Sharing ◽  
Linear Congruence ◽  
Progressive Secret Sharing ◽  
Congruence Equation

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 ENUMERATION PROBLEMS FOR A LINEAR CONGRUENCE EQUATION

2014 ◽  
Vol 18 (1) ◽  
pp. 265-275 ◽  
Author(s):  
Wun-Seng Chou ◽  
Tian-Xiao He ◽  
Peter Shiue
Keyword(s):  
Linear Congruence ◽  
Enumeration Problems ◽  
Congruence Equation

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 Progressive Secret Sharing with Adaptive Priority and Perfect Reconstruction

2021 ◽  
Vol 7 (4) ◽  
pp. 70
Author(s):  
Heri Prasetyo ◽  
Chih-Hsien Hsia ◽  
Alim Wicaksono Hari Prayuda
Keyword(s):  
Secret Sharing ◽  
Recovery Process ◽  
Color Images ◽  
Perfect Reconstruction ◽  
Visual Secret Sharing ◽  
Secret Image ◽  
Progressive Visual Secret Sharing ◽  
A New Technique ◽  
Progressive Secret Sharing ◽  
Exclusive Or

A new technique for progressive visual secret sharing (PVSS) with adaptive priority weight is proposed in this paper. This approach employs the bitwise and eXclusive-OR (XOR) based approaches for generating a set of shared images from a single secret image. It effectively overcomes the former scheme limitation on dealing with an odd number of stacked or collected shared images in the recovery process. The presented technique works well when the number of stacked shared images is odd or even. As documented in experimental results, the proposed method offers good results over binary, grayscale, and color images with a perfectly reconstructed secret image. In addition, the performance of the proposed method is also supported with theoretical analysis showing its lossless ability to recover the secret image. However, it can be considered as a strong substitutive candidate for implementing a PVSS system.

Sign in / Sign up

Export Citation Format

Share Document