Ideal contrast visual cryptography schemes with reversing

Cimato, Stelvio; Santis, Alfredo De; Ferrara, Anna Lisa; Masucci, Barbara

doi:10.1016/j.ipl.2004.10.011

Cited by 93 publications

(31 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many improvements and extensions follows [1]- [3], [5], [6], [8], [10], [11], [13], [15]- [17], [22]- [25]. For example, Ateniese et al [1] proposed an elegant VCS for general access structures based on the cumulative array method.…”

Section: B Previous Workmentioning

confidence: 99%

See 1 more Smart Citation

Cheating Prevention in Visual Cryptography

Tzeng

2007

IEEE Trans. on Image Process.

118

View full text Add to dashboard Cite

Abstract-Visual cryptography (VC) is a method of encrypting a secret image into shares such that stacking a sufficient number of shares reveals the secret image. Shares are usually presented in transparencies. Each participant holds a transparency. Most of the previous research work on VC focuses on improving two parameters: pixel expansion and contrast. In this paper, we studied the cheating problem in VC and extended VC. We considered the attacks of malicious adversaries who may deviate from the scheme in any way. We presented three cheating methods and applied them on attacking existent VC or extended VC schemes. We improved one cheat-preventing scheme. We proposed a generic method that converts a VCS to another VCS that has the property of cheating prevention. The overhead of the conversion is near optimal in both contrast degression and pixel expansion.

show abstract

Section: B Previous Workmentioning

confidence: 99%

“…Most of the previous research work on VC focused on improving two parameters: pixel expansion and contrast [5], [6], [8], [11], [13], [16], [23]. In these cases, all participants who hold shares are assumed to be semi-honest, that is, they will not present false or fake shares during the phase of recovering the secret image.…”

Section: Introductionmentioning

confidence: 99%

Cheating Prevention in Visual Cryptography

Tzeng

2007

IEEE Trans. on Image Process.

118

View full text Add to dashboard Cite

show abstract

“…Particularly, the first and the second methods need Mach-Zehnder Interferometers or liquid crystal displays to decode the secret image for the ( , ) − , and will inevitably make the cryptography system complicated and cause many difficulties, such as aligning the pixels and signal attenuation. For the third method, it will need many reversing copies to decode the secret image, see examples in [7,33]. In other words, the XOR based VCS is most practical for the (2, ) case.…”

Section: Introductionmentioning

confidence: 99%

Optimal XOR Based (2,n)-Visual Cryptography Schemes

Liu

2015

Digital-Forensics and Watermarking

View full text Add to dashboard Cite

A (2, )-Visual Cryptography Scheme (VCS) is a kind of secret sharing scheme, where participants share a secret image, and any two of them can recover the secret image visually without any cryptographic knowledge and computation devices, but any one of them cannot get any information about the secret image other than the size of the secret image. This paper studies the (2, )− , and shows the smallest (optimal) pixel expansion of such schemes, and the largest possible contrast for the (2, ) − given its optimal pixel expansion. It also shows the largest (optimal) contrast of the (2, ) − , and the smallest possible pixel expansion of such schemes given their optimal contrast. The results of this paper show that the (2, ) − can achieve smaller pixel expansion and larger contrast than that of (2, ) − . It also shows that the construction of the basis matrix of optimal contrast (2, )− is equivalent to the construction of binary codes when they reach the maximum capability, and the construction of a specific class of optimal contrast (2, ) − for = 2 − 1 is given.

show abstract

“…Liu et al [17] proposed an EVCS for the even k which based on the "XOR" operation, this can make the share images show the meaningful content, but there exists extra pixel expansion. So far the study of VCS has been mainly on the OR and XOR operations [18]- [20]. By a comparison of these two operation, we can find that XOR operation -based VCS have better parameters in the sense of large contrast and smaller pixel expansion, but the used hardware devices are a bit more complex than the OR operation-based VCS.…”

Section: Introductionmentioning

confidence: 99%

K out of K Extended Visual Cryptography Scheme Based on “XOR”

Dang¹,

He²,

Wang³

et al. 2015

IJCCE

View full text Add to dashboard Cite

Visual cryptography schemes (VCS) is an encryption technique that utilizes human visual system in recovering secret image and it does not require any complex calculation. Many VCSs without pixel expansion have been proposed. But they recover secret image with low contrast due to the stacking operation. To improve the quality of recovered image, XOR-based VCS has been proposed. However, shares constructed from XOR-based VCS are random-looking. It suffers a management problem which dealers cannot visually identify each share. In this paper, we propose an (k, k) extended visual cryptography scheme (EVCS) by "XOR" operation to solve above mentioned problem. This is implemented by diving the share image into two parts using a parameter and operating the secret pixels and cover pixels respectively. Comparing with previous schemes, the qualities of share images and recovered image are improved, and our scheme also suit the "OR" operation.

show abstract

Ideal contrast visual cryptography schemes with reversing

Cited by 93 publications

References 13 publications

Cheating Prevention in Visual Cryptography

Cheating Prevention in Visual Cryptography

Optimal XOR Based (2,n)-Visual Cryptography Schemes

K out of K Extended Visual Cryptography Scheme Based on “XOR”

Contact Info

Product

Resources

About