scispace - formally typeset
Book ChapterDOI

Flexible Visual Cryptography Scheme and Its Application

TLDR
Two visual cryptography schemes which simulated the principle of fountains are proposed which are more general and simpler, real flexible and has competitive visual quality for the recovered secret image.
Abstract
For visual cryptography scheme (VCS), normally, the size of the recovered secret image will be expanded by m( ≥ 1) times of the original secret image. In most cases, m is not a square number, hence the recovered secret image will be distorted. Sometimes, m is too large that will bring much inconvenience to the participants to carry the share images. In this paper, we propose two visual cryptography schemes which simulated the principle of fountains. The proposed schemes have two advantages: non-distortion and flexible (with respect to the pixel expansion). Furthermore, the proposed schemes can be applied to any VCS that is under the pixel by pixel encryption model, such as VCS for general access structure, color VCS and extended VCS, and our VCS does not restrict to any specific underlying operation. Compared with other non-distortion schemes, the proposed schemes are more general and simpler, real flexible and has competitive visual quality for the recovered secret image.

read more

Citations
More filters
Journal Article

A general formula of the (t, n)-threshold visual secret sharing scheme

TL;DR: In this article, a new method for construction of the basis matrices of the (t, n)-threshold visual secret sharing scheme (VSSS) for any n ≥ 2 and 2 ≤ t ≤ n.
Posted Content

Embedded Extended Visual Cryptography Schemes.

TL;DR: This paper proposes a construction of EVCS which is realized by embedding random shares into meaningful covering shares, and it is called the embedded EVCS, and has competitive visual quality compared with many of the well-known EVCSs in the literature.
Journal ArticleDOI

Deterministic extended visual cryptographic schemes for general access structures with OR-AND and XOR-AND operations

TL;DR: Two deterministic constructions for EVCS with a relative contrast of 0.333 are proposed by utilizing the ideal contrast deterministic Constructions for VCS as a building block and are applicable to share secret binary images only.
Journal ArticleDOI

Secured approach for authentication using threshold-based hierarchical visual cryptography

TL;DR: Threshold based hierarchical visual cryptography encrypts the secret in such a way that decoding is performed easily by human visual system and one-way hashing is applied on all the shares to reduce the time complexity.
Journal ArticleDOI

A new visual evaluation criterion of visual cryptography scheme for character secret image

TL;DR: In this paper, a novel method is proposed to obtain recognition result of the revealed character secret image through simulating the recognition procedure of the authors' human eyes and it is demonstrated that recognition rate can be regarded as a new visual evaluation criterion of VCS for charactersecret image.
References
More filters

Visual Cryptography

Moni Naor, +1 more
TL;DR: In this paper, a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is proposed, which is called k-out-of-n secret sharing.
BookDOI

Advances in Cryptology — CRYPTO ’96

Neal Koblitz
TL;DR: This work presents new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function, and proves that NMAC and HMAC are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.
Journal ArticleDOI

Visual Cryptography for General Access Structures

TL;DR: This paper examines graph-based access structures, i.e., access structures in which any qualified set of participants contains at least an edge of a given graph whose vertices represent the participants of the scheme, and provides a novel technique for realizing threshold visual cryptography schemes.
Book

Advances in Cryptology - ASIACRYPT 2002

Yuliang Zheng
TL;DR: It is concluded that from a practical standpoint, the security of RSA relies exclusively on the hardness of the relation collection step of the number field sieve.
Related Papers (5)