An Optimal (2, 2) Visual Cryptography Schemes For Information Security

DOI

10.2991/978-94-6463-196-8_15How to use a DOI?

Keywords

(2, 2) Visual Cryptography Scheme; Contrast Optimal Scheme; extensive codebook design; No Pixel Expansion; No flipping Issues

Abstract

Visual information security is one of the important security aspects. Secret sharing based schemes of visual cryptography permits secret image encryption and provides a more secure method which allows access to more sensitive visual information. In modern k out of n secret sharing scheme secret image to be encrypted that is partitioned into n different parts or shares. Each part or share is then distributed among the n users are different, and then we can specify at least k out of n shares are needed to get the original secret image. Recently many Secrets Sharing Schemes of visual cryptography have been developed ranging from (2 out of 2 or 2, 2) Visual Cryptography Schemes to Segment based secret sharing schemes of visual cryptography. But most of the schemes are based on processing the binary image as secret, which is not suitable for many applications that are using color information images, and the security of the share is an important issue that is less discussed in previous work. Again there are many problems of secret sharing schemes such as pixel expansions, alignment problems, extensive requirement of the codebook design, flipping issues, distortion problem, and thin line problems are quite unresolved.

In this paper a new secure (2, 2) secret sharing scheme is suggested for securely transmitting the images over the network. The suggested approach can also provide more secured shares and overcome the problems such as pixel expansion, alignment problem, extensive codebook design, flipping Issues, and distortion problem. Finally the result is compared with previously known methods. The Results obtained and the analysis of the suggested method is used to predict the efficiency of the method.

Copyright

© 2023 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Datta R. Somwanshi
AU  - Vikas T. Humbe
PY  - 2023
DA  - 2023/08/10
TI  - An Optimal (2, 2) Visual Cryptography Schemes For Information Security
BT  - Proceedings of the First International Conference on Advances in Computer Vision and Artificial Intelligence Technologies (ACVAIT 2022)
PB  - Atlantis Press
SP  - 164
EP  - 177
SN  - 1951-6851
UR  - https://doi.org/10.2991/978-94-6463-196-8_15
DO  - 10.2991/978-94-6463-196-8_15
ID  - Somwanshi2023
ER  -