Enhancing multi-factor cheating prevention in visual cryptography based minimum (k, n)-connected graph

Yang, Ching-Nung; Wu, Fu-Heng; Peng, Sheng‐Lung

doi:10.1016/j.jvcir.2018.07.012

Cited by 11 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 3, it is clear that the proposed scheme is better than other approaches [5][6][7][8][9]. Table 4 also shows the benefits of the proposed scheme compared to other approaches [14,15]. The performance of the proposed scheme based on the required number of verification shares is shown in Figure 8.…”

Section: Performance Analysismentioning

confidence: 90%

Cheating Prevention and Detection Technique in Visual Secret Sharing

Yadav¹,

Ranvijay²

2020

ISI

View full text Add to dashboard Cite

Visual secret sharing (VSS) has various applications such as visual authentication, access control, steganography, watermarking etc. But there is a possibility of cheating or collusive attack in VSS, where some malicious participants can mislead other honest participants by fake shares. Many research groups have worked on the above-stated problem. All the existed techniques suffer from at least one of the following problems such as additional verification shares, pixel expansion and poor visual quality of a reconstructed secret image. The proposed scheme overcomes all the above discussed shortcomings. Proposed work is based on the hamming code. Moreover, it retains the originality of bit by correcting the modified bit. The novelty of the proposed work is to convert the fake/ modified shares into the original shares with 100% accuracy. The theoretical and experimental analysis shows the effectiveness of the proposed work.

show abstract

Section: Performance Analysismentioning

confidence: 90%

Cheating Prevention and Detection Technique in Visual Secret Sharing

Yadav¹,

Ranvijay²

2020

ISI

View full text Add to dashboard Cite

show abstract

“…Because we share R, G and B colors directly, we do not need to use the bit p 9 to covey any information. Thus, this bit p 9 could be abandoned, or used as authentication bits to provide authentication capability like VC in [6] and PSIS in [10]. Collect (x 1 ...x 8 ), where x ∈ {r, g, bl}, and append the bit p 9 to form red, green, and blue shadow blocks B x where x ∈ {r, g, bl} as shown in Figure 4b.…”

Section: Extension Of (N N)-sdis To Share True Color Secret Imagementioning

confidence: 99%

“…The so-called VC [1][2][3][4][5][6] has a novel stacking-to-see property such that the involved participants can easily stack shadows to visually decode the secret through the human eye. This property makes VC applicable in many scenarios.…”

Section: Introductionmentioning

confidence: 99%

A n-out-of-n Sharing Digital Image Scheme by Using Color Palette

et al. 2019

Self Cite

View full text Add to dashboard Cite

A secret image sharing (SIS) scheme inserts a secret message into shadow images in a way that if shadow images are combined in a specific way, the secret image can be recovered. A 2-out-of-2 sharing digital image scheme (SDIS) adopts a color palette to share a digital color secret image into two shadow images, and the secret image can be recovered from two shadow images, while any one shadow image has no information about the secret image. This 2-out-of-2 SDIS may keep the shadow size small because by using a color palette, and thus has advantage of reducing storage. However, the previous works on SDIS are just 2-out-of-2 scheme and have limited functions. In this paper, we take the lead to study a general n-out-of-n SDIS which can be applied on more than two shadow. The proposed SDIS is implemented on the basis of 2-out-of-2 SDIS. Our main contribution has the higher contrast of binary meaningful shadow and the larger region in color shadows revealing cover image when compared with previous 2-out-of-2 SDISs. Meanwhile, our SDIS is resistant to colluder attack.Recently, Wei et al. use the bit-wise XOR operation to design a (2, 2) sharing digital image scheme (SDIS) [17] to share a 256-color (or true color) digital image. Wei et al.'s (2, 2)-SDIS is also a type of (k, n)-SIS where k = n = 2. Wei et al.'s (2, 2)-SDIS is the first SIS scheme using a 256-color palette. This color palette has 256 colors, where each color is composed of red (R), green (G), and blue (B) color planes. Each color and is chosen from a palette of 16,777,216(=2 24 ) colors (24 bits: each color plane has 8 bits). In VGA cards, 256 on-screen colors are chosen from a color palette, and these colors are most visible to the human eye and meanwhile conserve a bandwidth. When using a color palette, each pixel is represented by a color index in a 256-color color palette. Consider an example, a 256 × 256-pixel image. The file size is 256 × 256 × 1 bytes (color indices) +256 × 3 bytes (color palette) = 66,304 bytes, but is 256 × 256 × 3 = 196,608 bytes for using 24-bit true color format. Thus, the file size of a color image can be kept small when represented by a color palette. Because Wei et al.'s (2, 2)-SDIS is based on color palette, and thus it has the advantage of reducing storage.However, there are three weaknesses in Wei et al.'s SDIS: the incorrect assignment of color palette data for the color index 255, the erroneous recovery in secret image, and the partial region in shadow revealing the cover image. In [19], Yang et al. address these weaknesses and propose a new (2, 2)-SDIS. Both Wei et al.'s (2, 2)-SDIS and Yang et al.'s (2, 2)-SDIS are simple 2-out-of-2 scheme and have limited applications. In this paper, we take the lead to study a general (n, n)-SDIS, which can be applied on any n ≥ 3. The main weakness of Wei et al.'s (2, 2)-SDIS is the incorrect assignment of color palette data for some color indices, and this is tackled by using a complicated approach, partitioned sets, in Yang et al.'s (2, 2)-SDIS. In the proposed (n, n)-SDIS, beca...

show abstract

“…Most of the VC schemes inherited two drawbacks that are high pixel expansion and low contrast, which results in lower visual quality of the recovered image. Although some methods, including linear coding [1,14], supergraph [15,16], integer linear programming method [17][18][19], and linear algebraic technique [20,21], formulated the construction of VC schemes as the mathematical model to decrease the pixel expansion, the resulting pixel expansion m is still large located in [C k n · 2 k−2 + 1, C k−1 n−1 · 2 k−1 + 1]. The resulting contrast is quite small with a value 1/m.…”

Section: Introductionmentioning

confidence: 99%

A Novel XOR-Based Threshold Visual Cryptography with Adjustable Pixel Expansion

et al. 2020

View full text Add to dashboard Cite

A (k, n) visual cryptography (VC) scheme encodes a secret image into n shadows that are printed on transparencies distributed among a group of n participants secretly, and reveal the secret image by stacking no less than k of them. Its decryption requires no computation and attracts much attention in image security applications. The pixel expansion and contrast are two important characteristics to evaluate the visual quality of the revealed secret image for a (k, n)-VC scheme. The (k, n) XOR-based VC (XVC) schemes can greatly improve the visual quality including both pixel expansion and contrast. Previous methods require complex computation and result in high pixel expansion when they are used to construct such schemes. In this paper, we propose a pixel expansion adjustable (k, n)-XVC scheme, which allows pixel expansion to be changed among 2 k−1 − 1 different values. It can ensure each pixel being exactly recovered with the same average contrast no matter it takes any pixel expansion value. The least pixel expansion is much smaller than previous schemes. Our scheme can be easily implemented based on any conventional OR-based (k, n)-VC (OVC) scheme.

show abstract

Enhancing multi-factor cheating prevention in visual cryptography based minimum (k, n)-connected graph

Cited by 11 publications

References 23 publications

Cheating Prevention and Detection Technique in Visual Secret Sharing

Cheating Prevention and Detection Technique in Visual Secret Sharing

A n-out-of-n Sharing Digital Image Scheme by Using Color Palette

A Novel XOR-Based Threshold Visual Cryptography with Adjustable Pixel Expansion

Contact Info

Product

Resources

About