Prevention of cheating in visual cryptography by using coherent patterns

Lin, Pei-Yu; Wang, Ran-Zan; Chang, Yun‐Ting; Fang, Wen‐Pinn

doi:10.1016/j.ins.2014.12.046

Cited by 18 publications

(6 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where, nw and nb are the number of pixels in the region of white pixel and the region of a black pixel respectively and m is the pixel expansion. 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].…”

Section: Performance Analysismentioning

confidence: 84%

“…Further, Chen et al [7,8] also worked on extra verification shares. In 2015, Lin [9] worked to overcome the extra verification shares burden but it is having poor contrast of the recovered secret image. C. N Yang et al [10] have proposed another cheating prevention scheme which is based on (2, n) VSS, but it is not generalized scheme because it works on (3, n) VSS.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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: 84%

Section: Introductionmentioning

confidence: 99%

Cheating Prevention and Detection Technique in Visual Secret Sharing

Yadav¹,

Ranvijay²

2020

ISI

View full text Add to dashboard Cite

show abstract

“…Privacy preservation in data mining has become an important research area with many literature surveys. In [1][2][3][4][5] the authors describes various proposed methods in visual cryptography. In [6][7][8][9], various data mining techniques with privacy preservation is discussed along with various privacy disclosure problems.…”

Section: Literature Surveymentioning

confidence: 99%

PPDM for Medical Data using Visual Cryptography

Gunasekaran

2019

IJEAT

View full text Add to dashboard Cite

show abstract

“…In 2013, Hsiao-Ching Lin et al presented a letter-based visual cryptography scheme (LVCS) where natural language letters are used to represent pixels of secret images to construct meaningful shadow images and implemented the scheme in different programming languages [6]. Furthermore, various aspects of the security of VC schemes were discussed in [7][8][9].…”

Section: Introductionmentioning

confidence: 99%

Near-optimal pitch of a moiré grating in dynamic visual cryptography

Saunorienė¹,

Petrauskiene²,

Aleksiene³

et al. 2018

J. vibroeng.

View full text Add to dashboard Cite

Dynamic visual cryptography (DVC) is a technique for the encryption and decryption of visual secret information. The confidential visual information in DVC is concealed embedding the secret image into the regular moiré grating. The secret can be perceived from the cover image if only the cover image is oscillated according to a predefined law of motion and time-averaging techniques are used. The security of the encryption procedure and the quality of the decrypted image depend on the proper preselection of the pitches of a moiré grating used in the encryption stage. This paper presents the main principles of the determination of near-optimal pair of the pitches of moiré grating as well as graphical schemes and analytical equations in case of harmonic and chaotic oscillations.

show abstract

Prevention of cheating in visual cryptography by using coherent patterns

Cited by 18 publications

References 22 publications

Cheating Prevention and Detection Technique in Visual Secret Sharing

Cheating Prevention and Detection Technique in Visual Secret Sharing

PPDM for Medical Data using Visual Cryptography

Near-optimal pitch of a moiré grating in dynamic visual cryptography

Contact Info

Product

Resources

About