A Novel (2, 3)-Threshold Reversible Secret Image Sharing Scheme Based on Optimized Crystal-Lattice Matrix

The (k, n)-threshold reversible secret image sharing (RSIS) is technology that conceals the secret data in a cover image and produces n shadow versions. While k (kn) or more shadows are gathered, the embedded secret data and the cover image can be retrieved without any error. This article proposes an optimal (2, 3) RSIS algorithm based on a crystal-lattice matrix. Sized by the assigned embedding capacity, a crystal-lattice model is first generated by simulating the crystal growth phenomenon with a greedy algorithm. A three-dimensional (3D) reference matrix based on translationally symmetric alignment of crystal-lattice models is constructed to guide production of the three secret image shadows. Any two of the three different shares can cooperate to restore the secret data and the cover image. When all three image shares are available, the third share can be applied to authenticate the obtained image shares. Experimental results prove that the proposed scheme can produce secret image shares with a better visual quality than other related works.

Download Full-text

A Maze Matrix-Based Secret Image Sharing Scheme with Cheater Detection

Sensors ◽

10.3390/s20133802 ◽

2020 ◽

Vol 20 (13) ◽

pp. 3802 ◽

Cited By ~ 2

Author(s):

Ching-Chun Chang ◽

Ji-Hwei Horng ◽

Chia-Shou Shih ◽

Chin-Chen Chang

Keyword(s):

Secret Message ◽

Secret Image Sharing ◽

Secret Data ◽

Stego Image ◽

Detection Mechanism ◽

Lagrange Polynomials ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Secret Image Sharing Scheme

Secret image sharing is a technique for sharing a secret message in such a fashion that stego image shadows are generated and distributed to individual participants. Without the complete set of shadows shared among all participants, the secret could not be deciphered. This technique may serve as a crucial means for protecting private data in massive Internet of things applications. This can be realized by distributing the stego image shadows to different devices on the Internet so that only the ones who are authorized to access these devices can extract the secret message. In this paper, we proposed a secret image sharing scheme based on a novel maze matrix. A pair of image shadows were produced by hiding secret data into two distinct cover images under the guidance of the maze matrix. A two-layered cheat detection mechanism was devised based on the special characteristics of the proposed maze matrix. In addition to the conventional joint cheating detection, the proposed scheme was able to identify the tampered shadow presented by a cheater without the information from other shadows. Furthermore, in order to improve time efficiency, we derived a pair of Lagrange polynomials to compute the exact pixel values of the shadow images instead of resorting to time-consuming and computationally expensive conventional searching strategies. Experimental results demonstrated the effectiveness and efficiency of the proposed secret sharing scheme and cheat detection mechanism.

Download Full-text

A novel approach for multilevel multi-secret image sharing scheme

The Journal of Supercomputing ◽

10.1007/s11227-021-03747-y ◽

2021 ◽

Author(s):

Kanchan Bisht ◽

Maroti Deshmukh

Keyword(s):

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Novel Approach ◽

Secret Image Sharing Scheme

Download Full-text

Distortion less secret image sharing scheme for Internet of Things system

Cluster Computing ◽

10.1007/s10586-017-1345-y ◽

2017 ◽

Vol 22 (S1) ◽

pp. 2293-2307 ◽

Cited By ~ 13

Author(s):

Li Li ◽

M. Shamim Hossain ◽

Ahmed A. Abd El-Latif ◽

M. F. Alhamid

Keyword(s):

Internet Of Things ◽

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Secret Image Sharing Scheme

Download Full-text

Novel (n, n) Secret Image Sharing Scheme Based on Addition

2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing ◽

10.1109/iihmsp.2010.148 ◽

2010 ◽

Cited By ~ 11

Author(s):

Lin Dong ◽

Min Ku

Keyword(s):

Secret Image Sharing ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Secret Image Sharing Scheme

Download Full-text

Efficient Secret Image Sharing Scheme with Authentication and Cheating Prevention

Mathematical Problems in Engineering ◽

10.1155/2021/9274415 ◽

2021 ◽

Vol 2021 ◽

pp. 1-11

Author(s):

Lina Zhang ◽

Xuan Dang ◽

Li Feng ◽

Junhan Yang

Keyword(s):

Distributed Storage ◽

Limited Resources ◽

Secret Image Sharing ◽

Authentication Codes ◽

Authentication Code ◽

Secret Image ◽

Image Sharing ◽

Sharing Scheme ◽

Hash Algorithm ◽

Security Levels

Due to the widespread adoption and popularity of digital images in distributed storage, Secret Image Sharing (SIS) has attracted much attention. However, preventing the cheating of shares is an important problem that needs to be solved in the traditional SIS scheme. An adversary without image shares may participate in the restoration phase as a share owner. In this phase, the adversary can obtain real shares or prevent recovering real images by submitting fake shadows. Our schemes are based on the original Thien-Lin’s scheme. In the scheme I, we use some XOR operations to get two authentication codes through all secret pixel values to achieve a lightweight and fast-calculated authentication scheme for cheating prevention. This scheme is suitable for small devices with limited resources. In scheme II, we use a hash algorithm to generate the authentication code. This scheme is suitable for environments with larger storage space and higher security levels. Since all pixel values are involved in the authentication in our proposed schemes, it can prevent fake shadow images from cheating. Meanwhile, the shadow size is almost the same as the original Thien-Lin’s scheme. Experimental results and theoretical analysis show that the proposed schemes are feasible and effective.

Download Full-text