Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery

Ding, Wanmeng; Liu, Kesheng; Yan, Xuehu; Liu, Lintao

doi:10.4018/ijdcf.2018040107

Cited by 24 publications

(14 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The following experiment intends to compare our introduced Algorithm 1 with polynomial‐based ISS for

false(k, n false)

threshold in [4]. Fig.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Application of random elements in ISS

Yan

Liu

et al. 2020

IET Image Processing

Self Cite

View full text Add to dashboard Cite

“…The following experiment intends to compare our introduced Algorithm 1 with polynomial‐based ISS for

false(k, n false)

threshold in [4]. Fig.…”

Section: Resultsmentioning

confidence: 99%

“…As we know, digital image is a special form of data, in which each binary (greyscale) pixel is represented by 1 bit (8 bits or 1 B); thus, ISS is easily used in data secret sharing. The principle of ISS technology includes polynomial‐based method [3, 4], visual secret sharing (VSS) [5, 6], namely visual cryptography etc. [7, 8].…”

Section: Introductionmentioning

confidence: 99%

Application of random elements in ISS

Yan

Liu

et al. 2020

IET Image Processing

Self Cite

View full text Add to dashboard Cite

“…Herein, we provide some comparisons between our proposed scheme and other related typical schemes [4,6,23,24].…”

Section: Comparisons With Related Workmentioning

confidence: 99%

“…Ding et al [24] introduced a new solution to lossless recovery. Similar to Thien-and-Lin's scheme, integers from 250 to 255 are divided into two parts, but both parts are shared during one sharing phase.…”

Section: Psis With Lossless Recoverymentioning

confidence: 99%

“…Yang et al [23] utilized polynomial-based operations on Galois Field GF(2 8 ) instead of integer computations in the finite field. In Ding and coworkers' scheme [24], pixel values more than 250 also need to be divided, but then both parts are embedded into another two coefficients of the constructed polynomial during one single sharing phase. However, these solutions bring in some other negative effects, such as random shape changes, large shadow size and high computational complexity.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Zhou

Yan

et al. 2018

Symmetry

Self Cite

View full text Add to dashboard Cite

Thien-and-Lin's polynomial-based secret image sharing (PSIS) is utilized as the basic method to achieve PSISs with better performances, such as meaningful shares, two-in-one property and shares with different priorities. However, this (k, n) threshold PSIS cannot achieve lossless recovery for pixel values more than 250. Furthermore, current solutions to lossless recovery for PSIS have several natural drawbacks, such as large computational costs and random pixel expansion. In this paper, a lossless and efficient (k, n) threshold PSIS scheme with reduced shadow size is presented. For lossless recovery and efficiency, two adjacent pixels are specified as a secret value, the prime in the sharing polynomial is replaced with 65,537, and then the additional screening operation can ensure each shared value in the range [0, 65,535]. To reduce shadows size and improve security, only the first k − 1 coefficients are embedded with secret values and the last coefficient is assigned randomly. To prevent the leakage of secrets, generalized Arnold permutation with special key generating strategy is performed on the secret image prior to sharing process without key distribution. Both theoretical analyses and experiments are conducted to demonstrate the effectiveness of the proposed scheme.

show abstract

Modular‐based secret image sharing in Internet of Things: A global progressive‐enabled approach

Zhang

Zheng

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

Summary Due to the continuous development and progress of information technology, the Internet has also entered the era of big data based on the Internet of Things (IoT). How to protect the security of data stored and transmitted in the IoT is one of the urgent problems to be solved. This article focuses on the security issues of storage and transmission of image data in the IoT. Secret image sharing (SIS) is a kind of image protection mechanism by dividing an image into n shares, and different shares are given to different participants separately for preservation. Only when the number of shares reaches the threshold can the original image be recovered. From the perspective of image reconstruction mode, there are two types of SIS schemes: one is the traditional (k, n) threshold scheme, which provides an all‐or‐nothing reconstruction mode, the other is the progressive scheme, which can gradually restore the original image. In this article, a novel (k, k2) progressive secret image sharing based on modular operations is proposed, this method can divide the important images stored in the IoT into many parts and then transmit them to people in different places. It takes the whole as a unit in terms of the progressive recovery form. When the share reaches the threshold, certain blocks of the original image can be seen. As the share increases, the image will be clearer. When all shares participate in the reconstruction together, the original image can be restored without loss. Compared with other schemes, our scheme has the same smoothness, shadow size and satisfies the security, and is fine‐grained progressive.

show abstract

Polynomial-Based Secret Image Sharing Scheme with Fully Lossless Recovery

Cited by 24 publications

References 18 publications

Application of random elements in ISS

Application of random elements in ISS

Lossless and Efficient Polynomial-Based Secret Image Sharing with Reduced Shadow Size

Modular‐based secret image sharing in Internet of Things: A global progressive‐enabled approach

Contact Info

Product

Resources

About