A Weighted Threshold Visual Cryptography

Tu, Tai-Yuan; Chen, Tzung‐Her; Yang, Jimin; Wang, Chih‐Hung

doi:10.1007/978-981-13-9190-3_64

Cited by 1 publication

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…erefore, a qualified visual cryptography scheme must meet the following condition in visual recognition: Condition 1 (visually recognizable). e recovery image S′ is visually recognizable (α > 0) when p ≥ k, a.k.a., S′ can visually recognize the same secret as S with sufficient shadows [1,32].…”

Section: Feasibility and Safety Conditionsmentioning

confidence: 99%

“…In this section, we will compare the quality of the recovered image and a series of characteristics of the proposed scheme with some typical WVCS schemes with admirable features, such as Yang et al [30], Fan [31], and Tu et al [32] schemes. While we are concerned about the quality of the recovery image, we are also concerned about other features of the designed scheme, such as pixel expansion, codebook design, and weight leakage.…”

Section: Feature Comparisonmentioning

confidence: 99%

“…erefore, this work considers a weighted VCS with privileged based on random grids, in which secret sharing participant acquires a share with different weights, respectively, according to the importance, and all the eligible participant combinations can recover the secret through the overlay of secret shares. So far, the following VCSs considering the weight difference have been proposed: the privilege-based visual secret sharing model (PVSSM) [29], (2, n)-PVCS [30], random grid-based progressive visual secret sharing scheme with adaptive priority (RGPVSS) [31], and weighted (k, n)-threshold visual cryptography method [32]. In most existing VCSs, each share has the same secret recovery capability.…”

Section: Introductionmentioning

confidence: 99%

“…Crucially, for this scheme, codebook design is not indispensable. Tu et al [32] proposed a weighted (k, n)-threshold nonexpanded visual secret sharing scheme. e secret image can be recovered when the sum of the participant's weights is not less than the threshold k. Unfortunately, the quality of the secret images recovered by the above scheme is not satisfactory.…”

Section: Introductionmentioning

confidence: 99%

“…e contrast of the proposed scheme under the (3, 2, 4) threshold, compared with Tu et al[32], Fan et al[31], and Yang et al[30].…”

mentioning

confidence: 98%

See 4 more Smart Citations

Quantitative Weighted Visual Cryptographic (k, m, n) Method

Zeng

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

The weighted visual cryptographic scheme (WVCS) is a secret sharing technology, where weights are assigned to each shadow (participant) according to its importance. Among WVCS, the random grid-based WVCS (RGWVCS) is a frequently visited subject. It considers the premise of equality of all participants, without taking into account the existence of privileged people in reality. To address this problem of RGWVCS, this paper designs a new model, named as (k, m, n)-RGWVCS (where m < k < n ), in which the secret is encrypted into n shares and sent to k participants. In the recovery end, the secret could be reconstructed by minimum m shares when the privileged join in; otherwise, k shares are needed. The experimental results show that our method has the advantage of no pixel expansion and no codebook design by means of random grid. Moreover, the contrast of our model increased by 32.85% on average compared with that of other WVCS.

show abstract

Section: Feasibility and Safety Conditionsmentioning

confidence: 99%