scholarly journals A n-out-of-n Sharing Digital Image Scheme by Using Color Palette

Electronics ◽  
2019 ◽  
Vol 8 (7) ◽  
pp. 802
Author(s):  
Ching-Nung Yang ◽  
Qin-Dong Sun ◽  
Yan-Xiao Liu ◽  
Ci-Ming Wu
Keyword(s):  
Digital Image ◽  
Shadow Image ◽  
Cover Image ◽  
Secret Message ◽  
Secret Image Sharing ◽  
Color Palette ◽  
Secret Image ◽  
Image Sharing

A secret image sharing (SIS) scheme inserts a secret message into shadow images in a way that if shadow images are combined in a specific way, the secret image can be recovered. A 2-out-of-2 sharing digital image scheme (SDIS) adopts a color palette to share a digital color secret image into two shadow images, and the secret image can be recovered from two shadow images, while any one shadow image has no information about the secret image. This 2-out-of-2 SDIS may keep the shadow size small because by using a color palette, and thus has advantage of reducing storage. However, the previous works on SDIS are just 2-out-of-2 scheme and have limited functions. In this paper, we take the lead to study a general n-out-of-n SDIS which can be applied on more than two shadow. The proposed SDIS is implemented on the basis of 2-out-of-2 SDIS. Our main contribution has the higher contrast of binary meaningful shadow and the larger region in color shadows revealing cover image when compared with previous 2-out-of-2 SDISs. Meanwhile, our SDIS is resistant to colluder attack.

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

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2063
Author(s):  
Jiang-Yi Lin ◽  
Ji-Hwei Horng ◽  
Chin-Chen Chang
Keyword(s):  
Crystal Lattice ◽  
Three Dimensional ◽  
Lattice Models ◽  
Cover Image ◽  
Secret Image Sharing ◽  
Secret Data ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Growth Phenomenon

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.

Secret Image Sharing with Threshold Set

2012 ◽  
Vol 190-191 ◽  
pp. 364-368
Author(s):  
Dan Tang ◽  
Kui Liu
Keyword(s):  
Information Security ◽  
Digital Image ◽  
Research Problem ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Multichannel Transmission ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

Secret image sharing is an attractive research problem in information security filed. According to the high redundancy of the digital image, the paper proposed an entirely new secret image sharing scheme with threshold set. The new scheme makes secret image sharing more flexible, so we can apply the secret image sharing technology to more fields such as the storage of secret images, multichannel transmission of images and etc..

scholarly journals A compressed secret image sharing method with shadow image verification capability

2020 ◽  
Vol 17 (4) ◽  
pp. 4295-4316
Author(s):  
Guozheng Yang ◽  
◽  
Lintao Liu ◽  
Xuehu Yan ◽  
Keyword(s):  
Shadow Image ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing

scholarly journals A Reversible Steganography Scheme of Secret Image Sharing Based on Cellular Automata and Least Significant Bits Construction

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Wei-Tong Hu ◽  
Ming-Chu Li ◽  
Cheng Guo ◽  
Li-Feng Yuan
Keyword(s):  
Cellular Automata ◽  
Visual Quality ◽  
Cover Image ◽  
Secret Image Sharing ◽  
Embedding Capacity ◽  
Differential Attack ◽  
One Dimensional ◽  
Secret Image ◽  
Image Sharing ◽  
Least Significant Bits

Secret image sharing schemes have been extensively studied by far. However, there are just a few schemes that can restore both the secret image and the cover image losslessly. These schemes have one or more defects in the following aspects: (1) high computation cost; (2) overflow issue existing when modulus operation is used to restore the cover image and the secret image; (3) part of the cover image being severely modified and the stego images having worse visual quality. In this paper, we combine the methods of least significant bits construction (LSBC) and dynamic embedding with one-dimensional cellular automata to propose a new lossless scheme which solves the above issues and can resist differential attack and support parallel computing. Experimental results also show that this scheme has the merit of big embedding capacity.

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

Sensors ◽  
2020 ◽  
Vol 20 (13) ◽  
pp. 3802 ◽  
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.

SECRET IMAGE SHARING BASED ON CHAOTIC MAP AND CHINESE REMAINDER THEOREM

2012 ◽  
Vol 10 (03) ◽  
pp. 1250023 ◽  
Author(s):  
CHUNQIANG HU ◽  
XIAOFENG LIAO ◽  
DI XIAO
Keyword(s):  
Digital Image ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Chaotic Map ◽  
Secret Image Sharing ◽  
Image Size ◽  
Pixel Expansion ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme

Secret sharing is an efficient method for transmitting the image securely. This paper proposes an efficient secret sharing scheme for secret image. The protocol allows each participant to share a secret gray image with the rest of participants. In our scheme, a secret digital image is divided into n pieces, which are further distributed into n participants. The secret digital image can be reconstructed if and only if r or more legal participants cooperate together. These schemes have no pixel expansion. It is general in nature and can be applied on any image size. The proposed scheme is based on the chaotic map and the Chinese Remainder theorem. The security of the scheme is analyzed and the protocol is proven to be secure and be able to resist statistic and exhaustive attacks.

Secret image sharing and its algebraic coding method

2013 ◽  
Vol 32 (3) ◽  
pp. 669-678
Author(s):  
Xiao-jing WANG ◽  
Jia-jia FANG ◽  
Hong-liang CAI ◽  
Yi-ding WANG
Keyword(s):  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Coding Method

scholarly journals Robust Secret Image Sharing Resistant to Noise in Shares

2021 ◽  
Vol 17 (1) ◽  
pp. 1-22
Author(s):  
Xuehu Yan ◽  
Lintao Liu ◽  
Longlong Li ◽  
Yuliang Lu
Keyword(s):  
Chinese Remainder Theorem ◽  
Recovery Phase ◽  
Error Correcting Codes ◽  
Secret Image Sharing ◽  
Data Loss ◽  
Least Significant Bit ◽  
Recovery Method ◽  
Secret Image ◽  
Image Sharing ◽  
Salt And Pepper

A secret image is split into   shares in the generation phase of secret image sharing (SIS) for a  threshold. In the recovery phase, the secret image is recovered when any   or more shares are collected, and each collected share is generally assumed to be lossless in conventional SIS during storage and transmission. However, noise will arise during real-world storage and transmission; thus, shares will experience data loss, which will also lead to data loss in the secret image being recovered. Secret image recovery in the case of lossy shares is an important issue that must be addressed in practice, which is the overall subject of this article. An SIS scheme that can recover the secret image from lossy shares is proposed in this article. First, robust SIS and its definition are introduced. Next, a robust SIS scheme for a  threshold without pixel expansion is proposed based on the Chinese remainder theorem (CRT) and error-correcting codes (ECC). By screening the random numbers, the share generation phase of the proposed robust SIS is designed to implement the error correction capability without increasing the share size. Particularly in the case of collecting noisy shares, our recovery method is to some degree robust to some noise types, such as least significant bit (LSB) noise, JPEG compression, and salt-and-pepper noise. A theoretical proof is presented, and experimental results are examined to evaluate the effectiveness of our proposed method.

Distortion less secret image sharing scheme for Internet of Things system

2017 ◽  
Vol 22 (S1) ◽  
pp. 2293-2307 ◽  
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
Sign in / Sign up

Export Citation Format

Share Document