A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem

Guo, Cheng; Zhang, Huan; Song, Qiongqiong; Li, Mingchu

doi:10.1007/s11042-015-2885-x

Cited by 26 publications

(4 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It can be seen that theR is a result of CRT on XOR-ed all secret images. The last form trivially tells that the recovered masking coefficientR as given in (20) is identical to that of the masking coefficient R as given in (18), i.e. R =R.…”

Section: Analysis Of Former Approachmentioning

confidence: 99%

A Note on Multiple Secret Sharing Using Chinese Remainder Theorem and Exclusive-OR

Prasetyo

Guo

2019

IEEE Access

View full text Add to dashboard Cite

This paper reviews the former existing scheme on (n, n)-multiple secret sharing (MSS) for color images along with its slight limitation. This scheme generates a set of n shared images from a set of n secret images using the Chinese remainder theorem (CRT) and Boolean exclusive-OR (XOR) operation. This scheme works well if the number of secret images n is even number. However, the former scheme has a slight problem while the number of secret images n is an odd number. This paper proposes a new technique to overcome this problem by introducing symmetric and transferred masking coefficients to generate a set of shared images. To further improve the security level of the proposed method, a set of secret images is first transformed with hyperchaotic scrambling method before generating shared images. The security of the proposed (n, n)-MSS can also be increased by merging a shared color image into 2-D matrix representation. As documented in the experimental results, the proposed method offers a promising result on (n, n)-MSS scheme regardless of the number of secret images n is odd or even number. In addition, the proposed method outperforms the former existing (n, n)-MSS schemes in terms of quantitative measurements. INDEX TERMS Chinese remainder theorem, exclusive OR, secret sharing, symmetric masking coefficient, transferred masking.

show abstract

Section: Analysis Of Former Approachmentioning

confidence: 99%

A Note on Multiple Secret Sharing Using Chinese Remainder Theorem and Exclusive-OR

Prasetyo

Guo

2019

IEEE Access

View full text Add to dashboard Cite

show abstract

“…In addition to hierarchical schemes, many researchers have proposed various multi-secret image sharing schemes based on different technologies. For example, the Chinese remainder theorem [10], Boolean [27][28][29], and cellular automaton [30] have been proposed. In 2017, Yuan et al [31] first applied the adjustable threshold into secret image sharing, and they proposed the first adjustable-threshold secret image scheme.…”

Section: Related Workmentioning

confidence: 99%

“…Then, their scheme uses watermarking to provide the capability to verify shares, thereby preventing share spoofing attacks. Secret sharing can effectively ensure the security of secret information, but the traditional secret sharing schemes (e.g., [8][9][10][11][12]) cannot adjust the threshold value. However, in reality, the threshold value must be adjusted when the security policy or the adversary model changes.…”

Section: Introductionmentioning

confidence: 99%

A Novel Threshold Changeable Secret Image Sharing Scheme

Wang

et al. 2021

Symmetry

View full text Add to dashboard Cite

In secret image sharing, the image is divided into several stego images, which are managed by corresponding participants. The secret image can be recovered only when the number of authorized participants is no less than the threshold. Thus, it is widely used to protect essential images, such as engineering drawings and product design drawings. In the traditional secret image sharing scheme, the threshold is fixed and unique. However, in practice, the security policy and the adversarial structure may change; therefore, the threshold must be adjusted dynamically. In this paper, we propose a novel secret image sharing scheme with a changeable threshold capability. Our scheme eliminates the limit of the changeable threshold and reduces the computation required. Also, our scheme is the first threshold changeable secret image sharing scheme that can recover an undistorted cover image. The theoretical analysis shows that our scheme is safe even if the threshold is changed. The experiments demonstrated that the stego image generated by our algorithm has better quality than other changeable-threshold, secret image sharing algorithms.

show abstract

“…In 2002, Thien and Lin [7] used Shamir's secret sharing scheme [1] to share a secret image. There are many types of (k, n) − SIS schemes, such as progressive SIS [6], multiple SIS [9], meaningful SIS [10,11], partial SIS [12], scalable SIS [13,14], adversary structure scheme [5], public access structure [11,15,16], fraud detection [17,18], SIS based on encrypted pixels [8] etc.…”

mentioning

confidence: 99%

A verifiable essential secret image sharing scheme based on HLRs (VESIS‐(t, s, k, n))

Hadian Dehkordi,

Farahi,

Mashhadi

2023

CAAI Trans on Intel Tech

View full text Add to dashboard Cite

In traditional secret image sharing schemes, a secret image is shared among shareholders who have the same position. But if the shareholders have two different positions, essential and non‐essential, it is necessary to use essential secret image sharing schemes. In this article, a verifiable essential secret image sharing scheme based on HLRs is proposed. Shareholder's share consists of two parts. The first part is produced by the shareholders, which prevents the fraud of dealers. The second part is a shadow image that is produced by using HLRs and the first part of share. The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps. Also, for verifying shadow images, Bloom Filters are used for the first time. The proposed scheme is more efficient than similar schemes, and for the first part of the shares, has formal security.

show abstract

A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem

Cited by 26 publications

References 18 publications

A Note on Multiple Secret Sharing Using Chinese Remainder Theorem and Exclusive-OR

A Note on Multiple Secret Sharing Using Chinese Remainder Theorem and Exclusive-OR

A Novel Threshold Changeable Secret Image Sharing Scheme

A verifiable essential secret image sharing scheme based on HLRs (VESIS‐(t, s, k, n))

Contact Info

Product

Resources

About