Meaningful Share Generation for Increased Number of Secrets in Visual Secret-Sharing Scheme

This paper presents a new scheme for hiding two halftone secret images into two meaningful shares created from halftone cover images. Meaningful shares are more desirable than noise-like (meaningless) shares in Visual Secret Sharing because they look natural and do not attract eavesdroppers' attention. Previous works in the field focus on either increasing number of secrets or creating meaningful shares for one secret image. The method outlined in this paper both increases the number of secrets and creates meaningful shares at the same time. While the contrast ratio of shares is equal to that of Extended Visual Cryptography, two secrets are encoded into two shares as opposed to one secret in the Extended Visual Cryptography. Any two natural-looking images can be used as cover unlike the Halftone Visual Cryptography method where one cover should be the negative of the other cover image and can only encode one secret. Effectiveness of the proposed method is verified by an experiment.

Download Full-text

(3, 3) Visual Cryptography for Online Certificate Authentication

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.f1302.089620 ◽

2020 ◽

Vol 9 (6) ◽

pp. 152-156

Keyword(s):

Academic Achievement ◽

Secret Sharing ◽

Visual Cryptography ◽

Secret Message ◽

Secret Sharing Scheme ◽

Visual Secret Sharing ◽

Job Interview ◽

Sharing Scheme ◽

Visual Cryptography Scheme ◽

Full Proof

Today organizations face a challenge while recruiting candidates, who provide forged mark sheets in order to get a job. To prevent wrong hiring a detailed and thorough approach is needed to verify the authentication of both the candidate and the marks obtained by him/her. There are so many modern cryptographic protocols available which can be used for authenticating individual’s academic achievement certificates. Visual Cryptography is a simple and secure way to allow the secret sharing of images without any cryptographic computations or the use of encryption or decryption keys. The novelty of the visual secret sharing scheme is in its decryption process where human visual system (HVS) is employed for decryption of secret shares. In this paper we have discussed (3, 3) visual cryptography scheme which can be used to generate shares and distributes them among three parties, i.e. the Job Seeker, Certificate Issuance Authority and the Organization conducting Job interview. Secret message can be decrypted only if all the three shares are available. Every certificate carries a unique number which is encrypted using visual cryptography and without handshaking of all the parties it is impossible to decrypt, thus ensuring full proof authentication.

Download Full-text

Secure visual secret sharing scheme for color images using visual cryptography and digital watermarking

2017 Second International Conference on Electrical, Computer and Communication Technologies (ICECCT) ◽

10.1109/icecct.2017.8117849 ◽

2017 ◽

Cited By ~ 1

Author(s):

Jitendra Saturwar ◽

D.N. Chaudhari

Keyword(s):

Digital Watermarking ◽

Secret Sharing ◽

Visual Cryptography ◽

Color Images ◽

Secret Sharing Scheme ◽

Visual Secret Sharing ◽

Sharing Scheme

Download Full-text

A novel visual secret sharing scheme for multiple secrets via error diffusion in halftone visual cryptography

2011 International Conference on Recent Trends in Information Technology (ICRTIT) ◽

10.1109/icrtit.2011.5972436 ◽

2011 ◽

Cited By ~ 5

Author(s):

L. Jani Anbarasi ◽

M. Jenila Vincent ◽

G. S. Anandha Mala

Keyword(s):

Secret Sharing ◽

Visual Cryptography ◽

Error Diffusion ◽

Secret Sharing Scheme ◽

Visual Secret Sharing ◽

Multiple Secrets ◽

Sharing Scheme

Download Full-text

A New Bi-Level Encoding and Decoding Scheme for Pixel Expansion Based Visual Cryptography

International Journal of Rough Sets and Data Analysis ◽

10.4018/ijrsda.2019010102 ◽

2019 ◽

Vol 6 (1) ◽

pp. 18-42

Author(s):

Ram Chandra Barik ◽

Suvamoy Changder ◽

Sitanshu Sekhar Sahu

Keyword(s):

Information Security ◽

Secret Sharing ◽

Visual Cryptography ◽

Color Images ◽

Secret Sharing Scheme ◽

Normal Vision ◽

Visual Secret Sharing ◽

Pixel Expansion ◽

Host Image ◽

Sharing Scheme

Mapping of image-based object textures to ASCII characters can be a new modification towards visual cryptography. Naor and Shamir proposed a new dimension of Information security as visual cryptography which is a secret sharing scheme among N number of participants with pixel expansion. Later on, many researchers extended the visual secret sharing scheme with no expansion of pixel regions in binary and color images. By stacking k shares the secret can be decoded using normal vision. In this paper the authors have proposed a modification towards visual cryptography by converting the message in the form of printable ASCII character-based numerical encoding patterns in a binary host image. The encoding of the message is represented as ASCII numeric and a texture of those numeric are arranged to form a binary host image. Then, N numbers of shares are built up but after stacking all the shares the decoding of the message is achieved by converting ASCII numeric to the secret.

Download Full-text