A Common Method of Share Authentication in Image Secret Sharing

Yan, Xuehu; Lu, Yuliang; Yang, Ching-Nung; Zhang, Xinpeng; Wang, Shudong

doi:10.1109/tcsvt.2020.3025527

Cited by 44 publications

(16 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 THE PROPOSED SCHEME [31], the PSIS technique is employed. Indeed, PSIS is derived from Shamir's secret sharing [18] in a prime field of p. In PSIS, k secret pixels are embedded into the k coefficients a…”

Section: Yang Et Al's (N N)-bmsismentioning

confidence: 99%

See 1 more Smart Citation

Boolean-based Two-in-One Secret Image Sharing by Adaptive Pixel Grouping

Peng

2023

ACM Trans. Multimedia Comput. Commun. Appl.

View full text Add to dashboard Cite

The two-in-one secret image sharing (TiOSIS) technique is a hybrid scheme that protects a secret image by combining visual cryptography (VCS) and polynomial-based secret image sharing (PSIS). There are two decoding methods available in TiOSIS: stacking-to-see decryption and lossless image recovery. However, the majority of current TiOSIS methods use Lagrange interpolation to precisely reconstruct the secret, which would result in intense computations. In this paper, an efficient TiOSIS scheme using Boolean XOR operation for lossless image recovery is proposed. The proposed scheme consists of three building blocks: shared data generation, shadow construction, and image decryption. In shared data generation, the grayscale secret image is processed by a Boolean-based SIS to derive the shared bits. In shadow construction, an adaptive pixel grouping strategy is utilized to determine a grouping pattern. The halftone image adjustment algorithm is adopted to generate a suitable halftone image. With the grouping pattern and halftone image, we construct the shadows via the group-pixel embedding and sharing approach. In image decryption, we can reveal the secret image by stacking-to-see decoding or Boolean-based lossless image recovery. Extensive experiments and comparisons are illustrated to show the effectiveness and benefits of the proposed scheme.

show abstract

Section: Yang Et Al's (N N)-bmsismentioning

confidence: 99%

“…Yang and Yang [38] developed a TiOSIS with error correcting. Yan et al [31] exploited the authentication mechanism in PSIS. Indeed, their approach is a TiOSIS which utilizes the VCS decoding for authentication.…”

Section: Introductionmentioning

confidence: 99%

Boolean-based Two-in-One Secret Image Sharing by Adaptive Pixel Grouping

Peng

2023

ACM Trans. Multimedia Comput. Commun. Appl.

View full text Add to dashboard Cite

show abstract

“…According to the implementation principle, the VCS can be divided into schemes based on the basis matrix [7] and the random grid [10]. In the VCS field, current researches focus on these areas, including improving the visual quality of reconstructed images [11,12], implementing general access structures [13,14], share authentication [15], and meaningful shadow images [16][17][18].…”

Section: Introductionmentioning

confidence: 99%

Weighted Polynomial-Based Secret Image Sharing Scheme with Lossless Recovery

Wang

Chen

Gong

et al. 2021

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

In some particular scenes, the shadows need to be given different weights to represent the participants’ status or importance. And during the reconstruction, participants with different weights obtain various quality reconstructed images. However, the existing schemes based on visual secret sharing (VSS) and the Chinese remainder theorem (CRT) have some disadvantages. In this paper, we propose a weighted polynomial-based SIS scheme in the field of GF (257). We use k , k threshold polynomial-based secret image sharing (SIS) to generate k shares and assign them corresponding weights. Then, the remaining n − k shares are randomly filled with invalid value 0 or 255. When the threshold is satisfied, the number and weight of share can affect the reconstructed image’s quality. Our proposed scheme has the property of lossless recovery. And the average light transmission of shares in our scheme is identical. Experiments and theoretical analysis show that the proposed scheme is practical and feasible. Besides, the quality of the reconstructed image is consistent with the theoretical derivation.

show abstract

“…e secret image can be recovered by stacking shares, and when the computation device is available, we can also choose the XOR operation to recover the secret image in a lossless manner [4,5]. At present, the research on VC is mainly divided into basis matrix based [3,6,7] and random grid based [8][9][10]. However, the image quality recovered by this scheme is poor [11], so we choose a polynomial-based scheme as our scheme.…”

Section: Introductionmentioning

confidence: 99%

An Intragroup and Intergroup Multiple Secret Images’ Sharing Scheme with Each Participant Holding One Shadow Image

Wang

Yan

Chen

et al. 2021

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

In some particular situations, participants need to recover different secrets both within a group (i.e., intragroup) and between two groups (i.e., intergroup). However, most of the existing multilevel secret sharing (MLSS) and multigroup secret sharing (MGSS) schemes mainly focus on how to protect a secret between one or more groups. In this paper, we propose a polynomial-based scheme to share multiple secret images both within a group and between groups. The random elements’ utilization model of integer linear programming is used to find polynomial coefficients that meet certain conditions so that each participant holds only one shadow image and some of them can recover secrets of both intergroup and intragroup. In addition, our scheme based on polynomials has the advantage of low computational complexity. Theoretical analysis and experiments show that the proposed scheme is feasible and effective.

show abstract

A Common Method of Share Authentication in Image Secret Sharing

Cited by 44 publications

References 40 publications

Boolean-based Two-in-One Secret Image Sharing by Adaptive Pixel Grouping

Boolean-based Two-in-One Secret Image Sharing by Adaptive Pixel Grouping

Weighted Polynomial-Based Secret Image Sharing Scheme with Lossless Recovery

An Intragroup and Intergroup Multiple Secret Images’ Sharing Scheme with Each Participant Holding One Shadow Image

Contact Info

Product

Resources

About