Visual Cryptography for General Access Structures

Ateniese, Giuseppe; Blundo, Carlo; Santis, Alfredo De; Stinson, Douglas R.

doi:10.1006/inco.1996.0076

Cited by 503 publications

(220 citation statements)

References 8 publications

Supporting

Mentioning

216

Contrasting

Unclassified

Order By: Relevance

“…Popular visual secret sharing (VSS) schemes, such as those proposed in [1], [6]- [9], allow for visual recovery of the encrypted images [1]. By utilizing the transparent/frosted representation of the shares (usually printed on transparencies) and color mixing principles, the color VSS schemes such as those listed in [12], [14], [15] use the properties of the human visual system (HVS) to force the recognition of a secret message from the required set of shares without additional computations or any knowledge of cryptography [1].…”

Section: Overview Of Color Image Secret Sharing Solutionsmentioning

confidence: 99%

“…The so-called {k, n}-threshold scheme [1], [4]- [9] encrypts the input image by splitting the original content into n noise-like shares. The secret information is recovered only if k or more shares are available for decryption [6]- [9].…”

Section: Introductionmentioning

confidence: 99%

“…Among the various {k, n}-threshold schemes, a simple {2, 2} solution, seen as a private-key cryptosystem [8], [9], takes a great popularity due to its simplicity and adequate information security. The encryption process splits the secret image into two noise-like shares which are delivered to the end-user independently.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Cost-Effective Private-Key Cryptosystem for Color Image Encryption

Lukáč

Plataniotis

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents a cost-effective private-key cryptosystem for color images. The scheme allows for secret sharing of the color image by generating two color shares with dimensions identical to those of the original. Encryption is performed via simple binary operations realized at the image bit-levels altering both the spectral correlation among the RGB color components and the spatial correlation between the neighboring color vectors. The decryption procedure uses both noise-like color shares as the input and recovers the original image with perfect reconstruction.

show abstract

Section: Overview Of Color Image Secret Sharing Solutionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Cost-Effective Private-Key Cryptosystem for Color Image Encryption

Lukáč

Plataniotis

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This picture gives an idea of the "arrow" vocabulary used and gives an example of what a user of the system would see when answering a challenge. 4 By virtue of visual secret splitting, absent the slide, the phone appears to be displaying random noise. To answer the challenge, the user would touch each cell and drag in the direction indicated in the table.…”

Section: System Overviewmentioning

confidence: 99%

High-Entropy Visual Identification for Touch Screen Devices

Filardo

Ateniese

2012

Information Security Practice and Experience

Self Cite

View full text Add to dashboard Cite

Abstract. We exhibit a system for improving the quality of user-derived keying material on touchscreen devices. We allow a device to recover previously generated, highly entropic data suitable for use as (part of) a strong secret key from a user's act of identifying to the device. Our system uses visual cryptography [22], using no additional electronics and no memorization on the part of the user. Instead, we require the use of a transparency overlaid on the touch-screen. Our scheme is similar to the identification scheme of [23] but tailored for constrained, touch-screen displays.

show abstract

“…We start by observing that restricting our attention only to schemes that can be expressed with base matrices is without loss of generality. Indeed given any c-color (k, n)-threshold scheme, as proved in [2,7], it is possible to construct a base matrix scheme with the same contrast. Such a base matrix scheme can be easily constructed by first constructing a scheme whose collections C i have the same cardinality (this can be done by duplicating each matrix of collection C i a number of times equal to the least common multiple of the cardinalities of the collections C divided by the cardinality of C i ) and then taking as base matrix for color i the matrix consisting of the concatenation of all the distribution matrices in C i .…”

Section: Upper Bound On the Contrast Of C-color (K N)-threshold Vcsmentioning

confidence: 99%

Colored Visual Cryptography Without Color Darkening

Cimato

Prisco

Santis

2005

Security in Communication Networks

View full text Add to dashboard Cite

In a visual cryptography scheme a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies. Non-qualified subsets of participants have no information about the secret image.In this paper we consider the case when the secret image is a colored image. Most of the previous work on colored visual cryptography allows the superposition of pixels having the same color assuming that the resulting pixel still has the same color. This is not what happens in reality since when superimposing two pixels of the same color one gets a darker version of that color, which effectively is a different color. Superimposing many pixels of the same color might result in a so dark version of the color that the resulting pixel might not be distinguishable from a black pixel.In this paper we propose a model where the reconstruction has to guarantee that the reconstructed secret pixel has the exact same color of the original one and not a darker version of it. We consider (k, n)-threshold schemes where a qualified set of participants consists of any k participants. We provide a general construction for any k, 2 ≤ k ≤ n and a construction for the special case k = 2.We also prove lower bounds on the pixel expansion (which is a measure of the goodness of the scheme) for the cases k = 2 and k = n. The lower bounds match the pixel expansion of the schemes provided in these two cases, thus proving that our schemes are optimal with respect to the pixel expansion. We also provide an upper bound on the contrast of (k, n)-threshold schemes and (2, n)-threshold schemes with optimal contrast.

show abstract

Visual Cryptography for General Access Structures

Cited by 503 publications

References 8 publications

A Cost-Effective Private-Key Cryptosystem for Color Image Encryption

A Cost-Effective Private-Key Cryptosystem for Color Image Encryption

High-Entropy Visual Identification for Touch Screen Devices

Colored Visual Cryptography Without Color Darkening

Contact Info

Product

Resources

About