Essential secret image sharing scheme with the same size of shadows

Li, Peng; Yang, Ching-Nung; Zhou, Zhili

doi:10.1016/j.dsp.2015.12.004

Cited by 50 publications

(23 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, 'No' concatenation of sub-shadows is better than 'Yes'. As shown in Table 4, only the proposed scheme and Chen et al's scheme [25] do not need the concatenation operation in the sharing process, which is better than Yang et al's scheme [21], Chen and Chen's [23], Li et al's scheme [24], and Chen's scheme [26].…”

Section: Discussionmentioning

confidence: 99%

“…Note: The smaller size of the shadows is better during storage and transmission. Table 2 shows the proposed scheme has a better performance on shadows' size than Li et al's scheme [24] and Chen et al's scheme [25]. Figure 6 also shows that the proposed scheme has a smaller size ratio than Chen's scheme [26].…”

Section: Comparisonmentioning

confidence: 92%

“…If a scheme applies multiple SIS, the dealer needs to concatenate the sub-shadows in some way so that the location of each sub-shadow needs to be recorded and each sub-shadow needs to be extracted in the reconstruction. To solve these problems, Li et al [24] proposed a (t, s, k, n)-ESIS scheme aimed to generate equal-sized shadows, which solves the problem of the different shadows' size. Besides, by constructing an expandable ESIS structure, Chen et al [25] could not only make the generated shadows with equal size but also avoid concatenation operation in the sharing process.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial

Liu

Wang

et al. 2019

Symmetry

Self Cite

View full text Add to dashboard Cite

As a popular technology in information security, secret image sharing is a method to guarantee the secret image’s security. Usually, the dealer would decompose the secret image into a series of shadows and then assign them to a number of participants, and only a quorum of participants could recover the secret image. Generally, it is assumed that every participant is equal. Actually, due to their position in many practical applications, some participants are given special privileges. Therefore, it is desirable to give an approach to generate shadows with different priorities shadows. In this paper, an efficient essential secret image sharing scheme using a derivative polynomial is proposed. Compared with existing related works, our proposed scheme can not only create the same-sized shadows with smaller size but also removes the concatenation operation in the sharing phase. Theoretical analysis and simulations confirm the security and effectiveness of the proposed scheme.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Comparisonmentioning

confidence: 92%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial

Liu

Wang

et al. 2019

Symmetry

Self Cite

View full text Add to dashboard Cite

show abstract

“…Additionally, by embedding the hash-based message the three types of cheating will probably be detected Moreover, they improve the security by using a random strategy with dynamic embedding. This scheme and [16] divided the shadow or image to a group.…”

Section: Using Secret Sharing Mechanism To Secure Imagesmentioning

confidence: 99%

Secure File Sharing in Multi-clouds using Shamir’s Secret Sharing Scheme

Althamary

Al-Kharobi

2016

TNC

View full text Add to dashboard Cite

Cloud computing is a significant model for permitting on-demand network access to shared data, software's, infrastructure, and platform resources. However, cloud storage needs a certain level of availability, confidentiality, and integrity. Information sensitivity and value encourage users to select a highly secure protocol. This work proposes a new mechanism to increase the user trust in cloud computing using the secret sharing technique. The proposed algorithm is using Base64 encoding to convert any file type to ASCII strings. Base64 strings do not need any extra process to be compressed and this can speed up the share building process. Each string is used to produce N shares (using Shamir Secret Sharing Scheme) where each share is stored in a separate location in the cloud.

show abstract

“…To date, many researchers have been involved in the development of this field. According to the techniques used, secret image sharing has many branches, including polynomial-based secret image sharing [1] [3], visual cryptography [4] [5], Boolean operation-based secret image sharing [6], cellular automaton-based secret image sharing [7] [8], Chinese Reminder Theorem-based secret image sharing [9] [10] [11] and so on.…”

mentioning

confidence: 99%

Robust Secret Image Sharing Scheme Against Noise in Shadow Images

Sun

Yan

et al. 2021

IEEE Access

View full text Add to dashboard Cite

The (k, n)-threshold secret image sharing scheme is an image protection method, whose security comes partly from precise mathematical calculations, and even a little change in shadow images will lead to a false recovered image. Thus, it is crucial to recover the secret image information in the presence of possible noise on shadow images, which has rarely been considered in previous work. In this paper, a robust (k, n)-threshold polynomial-based secret image sharing scheme(RPSIS) against noise on shadow images is proposed, which depends on the randomness of the sharing phase without any other techniques, such as steganography. Additionally, pixel expansion caused by the direct application of error correction codes is avoided. Experimental results and theoretical proof confirm the effectiveness of our scheme. The shadow images of the scheme are of the same size as secret image and the security of the scheme is also maintained with no information leakage. Even though the shadow images are modified by noise, the original secret image can be reconstructed without loss under the error correction capability, which provides more possibilities for the practical application of secret image sharing.

show abstract

Essential secret image sharing scheme with the same size of shadows

Cited by 50 publications

References 29 publications

An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial

An Efficient Essential Secret Image Sharing Scheme Using Derivative Polynomial

Secure File Sharing in Multi-clouds using Shamir’s Secret Sharing Scheme

Robust Secret Image Sharing Scheme Against Noise in Shadow Images

Contact Info

Product

Resources

About