An enhanced threshold visual secret sharing based on random grids

Yan, Xuehu; Liu, Xin; Yang, Ching-Nung

doi:10.1007/s11554-015-0540-4

Cited by 111 publications

(66 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Experimental results of (3,4) threshold PSIS based on Shamir's proposed PSS are given in Figure 1. Secret image S is shown in Figure 1a.…”

Section: Polynomial-based Secret Image Sharingmentioning

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

“…Experimental results of (3,4) threshold PSIS based on Shamir's proposed PSS are given in Figure 1. Secret image S is shown in Figure 1a.…”

Section: Polynomial-based Secret Image Sharingmentioning

confidence: 99%

“…Currently, there are two main categories in the field of SIS: visual cryptography scheme (VCS) [1][2][3] and polynomial-based SIS (PSIS). The best advantage of VCS is the stack-to-see property, which means the secret information can be visually recognized by human visual system (HVS) just with sufficient shares stacking.…”

Section: Introductionmentioning

confidence: 99%

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

show abstract

“…In the last paper of the first theme entitled ''An enhanced threshold visual secret sharing based on random grids'' by Yan et al [6], a new threshold random grids (RG)-based VSS scheme is presented to improve the visual quality of the previewed image. Compared with previous schemes, they proposed that a scheme can gain better visual quality in the reconstructed images as well as (k, n) threshold.…”

Section: Real-time Data Hiding and Visual Cryptographymentioning

confidence: 99%

Special Issue: Real-Time Data Hiding and Visual Cryptography

Kim

Chang

Yang

et al. 2018

J Real-Time Image Proc

View full text Add to dashboard Cite

“…Since then, many interesting schemes were proposed in recent years i.e. Guo et al [33], Wu and Sun [34], Shyu [35] and Yan et al [36] to improve the first scheme by Chen and Tsao [22]. They all focused on the threshold RG-based VCS, regarded as the basis for GAS-VCS and other applications.…”

Section: Introductionmentioning

confidence: 99%

“…Based on this observation, he improved the contrast by using some pixels in the first k pixels to replace the last n-k pixels, leading to increase the chance for the participants to hold the pixels in the (k, k)-VCS. Furthermore, Yan et al [36] enhanced the visual quality by changing the last n-k pixels from selecting the first k pixels one by one, through which the probability of covering the first k pixels in the recovered image is improved.…”

Section: Introductionmentioning

confidence: 99%

Improved Contrast for Threshold Random-grid-based Visual Cryptography

2018

KSII TIIS

View full text Add to dashboard Cite

Pixel expansion and contrast are two major performance parameters for visual cryptography scheme (VCS), which is a type of secret image sharing. Random Grid (RG) is an alternative approach to solve the pixel expansion problem. Chen and Tsao proposed the first (k, n) RGbased VCS, and then Guo et al., Wu et al., Shyu, and Yan et al. significantly improved the contrast in recent years. However, the investigations on improving the contrast of threshold RG-based VCS are not sufficient. In this paper, we develop a contrast-improved algorithm for (k, n) RG-based VCS. Theoretical analysis and experimental results demonstrate that the proposed algorithm outperformers the previous threshold algorithms with better visual quality and a higher accuracy of contrast.

show abstract

An enhanced threshold visual secret sharing based on random grids

Cited by 111 publications

References 24 publications

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

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

Special Issue: Real-Time Data Hiding and Visual Cryptography

Improved Contrast for Threshold Random-grid-based Visual Cryptography

Contact Info

Product

Resources

About