Image Security Using Visual Cryptography

Image Security Using Visual Cryptography

Bala Krishnan R., Manikandan G., Rajesh Kumar N., N. Rajesh
DOI: 10.4018/978-1-7998-8892-5.ch018
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

The use of digital image in a variety of disciplines has skyrocketed, particularly in multimedia, medicine, and social media. The integrity and confidentiality of digital images communicated over the internet can be jeopardized by a variety of security threats. As a result, the content of these digital images must be preserved at all costs for a variety of domain-specific applications. Visual cryptography scheme (VCs) is an image-based approach to encrypt the secret image in such a way, and human visual system (HVS) can be used to decrypt the image. The core concepts of visual cryptography and applications of several visual cryptography schemes are covered in this chapter. The authors describe a unique reversible data hiding method for protecting secret shares using a covering subset and recovering the secret image using an overlaying technique. This chapter also covers a comparative analysis of 2-out-of-n and 3-out-of-n visual cryptography schemes.
Chapter Preview
Top

Introduction

A secret is piece of information or collection of data which is kept from the knowledge of any but the initiated or privileged. Secret contents are used in various fields such as, education, entertainment, manufacturing, logistics, healthcare and medicine. So the protection of secret content is very crucial in the modern internet communication. Secret sharing is an extra special method as compared to conventional scheme. Secret sharing is a process which a secret can be distributed between groups of participants, whereby each participant is allocated a piece of the secret. This piece of the secret is known as a share. The secret can only be reconstructed when a sufficient number of shares are combined together. While these shares are separate, no information about the secret can be accessed. That is, the shares are completely useless while they are separated. Within a secret sharing scheme, the secret is divided into a number of shares and distributed among n persons. When any k or more of these persons (where kn) bring their shares together, the secret can be recovered. However, if k - 1persons attempt to reconstruct the secret, they will fail. Secret sharing involves four major steps, which is shown in Table 1.

Table 1.
Major steps in secret sharing
StepsDescription
Secret sharesNon-overlapped piece of information from the secret image
Image SplitterThe process is responsible for the division of secret image
CoalitionA sub collection of shares that need to satisfy the required condition
StackerA process responsible for reconstructing the secret image

Complete Chapter List

Search this Book:
Reset