Threshold Secret Image Sharing Research Articles

Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem

Verifiable Changeable Threshold Secret Image Sharing Scheme Based on LWE Problem

CP-PSIS: CRT and polynomial-based progressive secret image sharing

In (k, n) Progressive Secret Image Sharing (PSIS) schemes, n shares are obtained by sharing a secret image. With k to n shares, the secret image can be recovered progressively. No information of the secret image can be constructed by k-1 or fewer shares. Many Secret Image Sharing (SIS) schemes have been developed to achieve the progressive reconstruction property. However, such property is usually based on the pre-processing of the secret image which is inconvenient and would increase the cost of the algorithm. Moreover, in existing PSIS schemes, only if all of n shares are involved, the secret image can be completely reconstructed. That makes the schemes not fault-tolerant. Thus, a solution for the flexible and extendable PSIS scheme is required. In this paper, we propose a Chinese Remainder Theorem (CRT) and Polynomial-based Progressive Secret Image Sharing (CP-PSIS) scheme and a modified version of CP-PSIS scheme. The proposed schemes are the first to utilize the homomorphism of CRT in the Lagrange interpolation operation. The progressive property of the schemes is achieved by CRT. In the (k, n) threshold SIS, any k participants can obtain different versions of the secret image by choosing different parameters. Our proposed schemes achieve a high security based on CRT and polynomial. Theoretical analyses and experimental results have demonstrated that the proposed schemes are general, flexible and extendable for different PSIS applications.

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

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.

A Common General Access Structure Construction Approach in Secret Image Sharing

(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.

Secret Image Sharing with Dealer-Participatory and Non-Dealer-Participatory Mutual Shadow Authentication Capabilities

A ( k , n ) threshold secret image sharing (SIS) method is proposed to divide a secret image into n shadows. The beauty of this scheme is that one can only reconstruct a secret image with k or more than k shadows, but one cannot obtain any information about the secret from fewer than k shadows. In the ( k , n ) threshold SIS, shadow authentication means the detection and location of manipulated shadows. Traditional shadow authentication schemes require additional bits for authentication; need much information to be public; or need to put each shadow into a host image, utilizing the information hiding technique, which makes the generation, recovery and authentication complexity higher. Besides, most existing schemes work when a dealer participates in recovery. Our contribution is that we propose a SIS method for a ( k , n ) threshold with dealer-participatory and non-dealer-participatory mutual shadow authentication capabilities which integrates polynomial-based SIS and visual secret sharing (VSS) through using the result of VSS to “guide” the polynomial-based SIS by a screening operation. In our scheme, when an authentication image is public, all involved actors (participants and dealer) can mutually authenticate each other by exchange the lowest level plane instead of the whole shadow. Our scheme is suitable for the case with and without a dealer participate recovery. In addition, the proposed scheme has characteristics of low generation and authentication complexity, no pixel expansion, 100% detection rate and lossless recovery.

Progressive Secret Image Sharing Scheme Based on Semantic Segmentation

Secret Image Sharing (SIS) plays an important role in the field of information security. At present, from the perspective of image restoration, SIS schemes are roughly divided into two categories: traditional threshold SIS schemes and Progressive SIS (PSIS) schemes. The former provides an all-or-nothing recovery mode in image reconstruction phase. If one of these shadows is damaged or lost, the reconstruction will fail. In contrast, the latter can present the original image progressively during the reconstruction phase. In this paper, a PSIS scheme based on semantic segmentation is proposed, where only specific objects or sensitive areas in the image are shared. After simple processing, the remaining background images can be publicly transmitted on insecure channels of the network. The background image will be regarded as a normal picture by people without shares. Owners who have reached the share of trapdoor numbers can recover a key target in an image. As the share increases, more key targets can be recovered. This paper is the first to propose secure secret sharing of images based on semantic targets. Through this method, it is possible to perform permission control on the target that needs to be divided and shared. Since the shared object is not the entire image, it can save storage space to a certain extent. Finally, through the analysis of the experimental results and comparison with other works, it can be concluded that the proposed scheme has a higher level of security and the amount of data that needs to be transmitted is small.

Ramp secret image sharing.

Secret image sharing (SIS) belongs to but differs from secret sharing. In general, conventional (k,n) threshold SIS has the shortcoming of "all-or-nothing". In this article, first we introduce ramp SIS definition. Then we propose a (k1,k2,n) ramp SIS based on the Chinese remainder theorem (CRT). In the proposed scheme, on the one hand, when we collect any k1 or more and less than k2 shadows, the secret image will be disclosed in a progressive way. On the other hand, when we collect any k2 or more shadows, the secret image will be disclosed losslessly. Furthermore, the disclosing method is only modular arithmetic, which can be used in some real-time applications. We give theoretical analyses and experiments to show the effectiveness of the proposed scheme.