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.

scholarly journals Meaningful Secret Image Sharing Scheme with High Visual Quality Based on Natural Steganography

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1452
Author(s):  
Yuyuan Sun ◽  
Yuliang Lu ◽  
Jinrui Chen ◽  
Weiming Zhang ◽  
Xuehu Yan
Keyword(s):  
Visual Quality ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Image Protection ◽  
Embedding Rate ◽  
Secret Image Sharing Scheme

The (k,n)-threshold Secret Image Sharing scheme (SISS) is a solution to image protection. However, the shadow images generated by traditional SISS are noise-like, easily arousing deep suspicions, so that it is significant to generate meaningful shadow images. One solution is to embed the shadow images into meaningful natural images and visual quality should be considered first. Limited by embedding rate, the existing schemes have made concessions in size and visual quality of shadow images, and few of them take the ability of anti-steganalysis into consideration. In this paper, a meaningful SISS that is based on Natural Steganography (MSISS-NS) is proposed. The secret image is firstly divided into n small-sized shadow images with Chinese Reminder Theorem, which are then embedded into RAW images to simulate the images with higher ISO parameters with NS. In MSISS-NS, the visual quality of shadow images is improved significantly. Additionally, as the payload of cover images with NS is larger than the size of small-sized shadow images, the scheme performs well not only in visual camouflage, but also in other aspects, like lossless recovery, no pixel expansion, and resisting steganalysis.

scholarly journals Secret Image Sharing Scheme Based on a Boolean Operation

2014 ◽  
Vol 14 (2) ◽  
pp. 98-113 ◽  
Author(s):  
Amitava Nag ◽  
Sushanta Biswas ◽  
Debasree Sarkar ◽  
Partha Pratim Sarka
Keyword(s):  
Fault Tolerance ◽  
Secret Sharing ◽  
Boolean Operation ◽  
Secret Image Sharing ◽  
Research Papers ◽  
Secret Image ◽  
Image Sharing ◽  
Generation Technique ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme

Abstract Traditionally extensive researches have been done on secret image sharing which support the fault tolerance property. But their reconstruction complexity is high. Some research papers on secret image sharing are also available with smaller reconstruction complexity, due to the use of a Boolean operation. But these research works lack the fault tolerance property which is the heart of secret sharing. This paper deals with a general (k, n) secret image sharing scheme for gray scale images with both low reconstruction complexity and preservation of the fault tolerance property. Moreover, the proposed sharing generation technique can also be applied on colour images.

scholarly journals Reversible Multiple Image Secret Sharing Using Discrete Haar Wavelet Transform

2018 ◽  
Vol 8 (6) ◽  
pp. 5004
Author(s):  
Ashwaq T. Hashim ◽  
Suhad A. Ali
Keyword(s):  
Wavelet Transform ◽  
Haar Wavelet ◽  
Secret Image Sharing ◽  
Haar Wavelet Transform ◽  
Secret Image ◽  
Image Sharing ◽  
Multiple Image ◽  
Sharing Scheme ◽  
Image Secret Sharing ◽  
Secret Image Sharing Scheme

<p>Multiple Secret Image Sharing scheme is a protected approach to transmit more than one secret image over a communication channel. Conventionally, only single secret image is shared over a channel at a time. But as technology grew up, there is a need to share more than one secret image. A fast (r, n) multiple secret image sharing scheme based on discrete haar wavelet transform has been proposed to encrypt m secret images into n noisy images that are stored over different servers. To recover m secret images r noise images are required. Haar Discrete Wavelet Transform (DWT) is employed as reduction process of each secret image to its quarter size (i.e., LL subband). The LL subbands for all secrets have been combined in one secret that will be split later into r subblocks randomly using proposed high pseudo random generator. Finally, a developed (r, n) threshold multiple image secret sharing based one linear system has been used to generate unrelated shares. The experimental results showed that the generated shares are more secure and unrelated. The size reductions of generated shares were 1:4r of the size of each of original image. Also, the randomness test shows a good degree of randomness and security.</p>

Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery

2018 ◽  
Vol 10 (2) ◽  
pp. 120-136 ◽  
Author(s):  
Wanmeng Ding ◽  
Kesheng Liu ◽  
Xuehu Yan ◽  
Lintao Liu
Keyword(s):  
Storage Capacity ◽  
Image Data ◽  
Secret Sharing Scheme ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
And Storage ◽  
Secret Image Sharing Scheme

Lossless recovery is important for the transmission and storage of image data. In polynomial-based secret image sharing, despite many previous researchers attempted to achieve lossless recovery, none of the proposed work can simultaneously satisfy an efficiency execution and at no cost of some storage capacity. This article proposes a secret sharing scheme with fully lossless recovery based on polynomial-based scheme and modular algebraic recovery. The major difference between the proposed method and polynomial-based scheme is that, instead of only using the first coefficient of sharing polynomial, this article uses the first two coefficients of sharing polynomial to embed the pixels as well as guarantee security. Both theoretical proof and experimental results are given to demonstrate the effectiveness of the proposed scheme.

scholarly journals Multi Secret Image Sharing Scheme of General Access Structure with Meaningful Shares

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1582
Author(s):  
Hongliang Cai ◽  
Dan Tang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Access Structure ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
General Access Structure ◽  
Multi Secret Sharing ◽  
Secret Image Sharing Scheme

A Multi Secret Image sharing scheme can share several secret images among certain participators securely. Boolean-based secret sharing schemes are one kind of secret sharing method with light-weighted computation compared to the previous complex algebraic-based methods, which can realize the sharing of multi secret images. However, the existing Boolean-based multi secret sharing schemes are mostly restricted to the particular case of (2, n) and (n, n), only few Boolean-based multi secret sharing schemes study the general access structure, and the shares are mostly meaningless. In this paper, a new Boolean-based multi secret sharing scheme with the general access structure is proposed. All the shares are meaningful, which can avoid attracting the attention of adversaries, and the secret images can be recovered in a lossless manner. The feasibility of the scheme is proven, the performance is validated by the experiments on the gray images, and the analysis of the comparison with other methods is also given out.

scholarly journals Applying cheating identifiable secret sharing scheme in multimedia security

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Zheng Ma ◽  
Yan Ma ◽  
Xiaohong Huang ◽  
Manjun Zhang ◽  
Yanxiao Liu
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Detection And Identification ◽  
Cheating Detection ◽  
Important Extension ◽  
Secret Image Sharing Scheme

Abstract In (k,n) secret sharing scheme, one secret is encrypted into n shares in such a way that only k or more shares can decrypt the secret. Secret sharing scheme can be extended into the field of multimedia that provides an efficient way to protect confidential information on multimedia. Secret image sharing is just the most important extension of secret sharing that can safely guard the secrecy of images among multiple participants. On the other hand, cheating detection is an important issue in traditional secret sharing schemes that have been discussed for many years. However, the issue of cheating detection in secret image sharing has not been discussed sufficiently. In this paper, we consider the cheating problem in the application of secret image sharing schemes and construct a (k,n) secret image sharing scheme with the ability of cheating detection and identification. Our scheme is capable of identifying cheaters when k participants involve in reconstruction. The cheating identification ability and size of shadow in the proposed scheme are improved from the previous cheating identifiable secret image sharing scheme.

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

Progressive secret image sharing scheme using meaningful shadows

2016 ◽  
Vol 9 (17) ◽  
pp. 4075-4088 ◽  
Author(s):  
Zhi-Hui Wang ◽  
Ya-Feng Di ◽  
Jianjun Li ◽  
Chin-Chen Chang ◽  
Hui Liu
Keyword(s):  
Secret Image Sharing ◽  
Secret Image ◽  
Image Sharing ◽  
Sharing Scheme ◽  
Secret Image Sharing Scheme
Sign in / Sign up

Export Citation Format

Share Document