scholarly journals Visual Cryptography Scheme with Essential Participants

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 838 ◽  
Author(s):  
Peng Li ◽  
Liping Yin ◽  
Jianfeng Ma

Visual cryptography scheme (VCS) shares a binary secret image into multiple shadows printed on transparencies. Stacking shadows can visually decode the secret image without computational resources. Specifically, a (k, n) threshold VCS ((k, n)-VCS) shares a secret image into n shadows, stacking any k shadows can reveal the secret image by human visual system, while any less than k shadows cannot decode any information regarding the secret image. In practice, some participants (essentials) play more important roles than others (non-essentials). In this paper, we propose a (t, s, k, n) VCS with essential participants (so called (t, s, k, n)-EVCS). The secret image is shared into n shadows with s essentials and n-s non-essentials. Any k shadows, including at least t essentials, can reveal the secret image. The proposed scheme is constructed from a monotonic (K, N)-VCS. The condition and optimal choice of (K, N)-VCS to construct (t, s, k, n)-EVCS are given by solving integer programming model. The experimental results are conducted to verify the feasibility of our scheme.

2017 ◽  
Vol 9 (2) ◽  
pp. 45-56 ◽  
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Song Wan ◽  
Wanmeng Ding ◽  
...  

In this paper, homomorphic visual cryptographic scheme (HVCS) is proposed. The proposed HVCS inherits the good features of traditional VCS, such as, loss-tolerant (e.g., (k, n) threshold) and simply reconstructed method, where simply reconstructed method means that the decryption of the secret image is based on human visual system (HVS) without any cryptographic computation. In addition, the proposed HVCS can support signal processing in the encrypted domain (SPED), e.g., homomorphic operations and authentication, which can protect the user's privacy as well as improve the security in some applications, such as, cloud computing and so on. Both the theoretical analysis and simulation results demonstrate the effectiveness and security of the proposed HVCS.


Cryptography ◽  
2020 ◽  
pp. 416-427
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Song Wan ◽  
Wanmeng Ding ◽  
...  

In this paper, homomorphic visual cryptographic scheme (HVCS) is proposed. The proposed HVCS inherits the good features of traditional VCS, such as, loss-tolerant (e.g., (k, n) threshold) and simply reconstructed method, where simply reconstructed method means that the decryption of the secret image is based on human visual system (HVS) without any cryptographic computation. In addition, the proposed HVCS can support signal processing in the encrypted domain (SPED), e.g., homomorphic operations and authentication, which can protect the user's privacy as well as improve the security in some applications, such as, cloud computing and so on. Both the theoretical analysis and simulation results demonstrate the effectiveness and security of the proposed HVCS.


Author(s):  
ASHWATHIMESANGLA AO

Visual cryptography is a secret sharing scheme for encrypting a secret image, it is a perfectly secure way that allows secret sharing without any cryptographic computation, which is termed as Visual Cryptography Scheme (VCS). In this paper secret image is divided into shares (printed on transparencies), and each share holds some information. At the receiver this shares are merged to obtain the secret information which is revealed without any complex computation. The proposed algorithm is for color host image, divided into three color planes Red, Green, Blue and merged with secret image which is binarized and divided into shares. The decoding requires aligning the result obtained by merging color host image and shares, so as to obtain the secret image.


Author(s):  
Chin-Chen Chang ◽  
Kuo-Feng Hwang

A simple image hiding scheme in spatial domain is proposed in this chapter. The main idea is to utilize a threshold mechanism to embed as much information of the secret image into the cover image as possible. The changing of the cover image is hard to be discovered by the human eyes because the threshold mechanism is setup especially to fit the human visual system. The experimental results show that the human visual system has improved the quality in terms of perceptibility. On the hiding capacity issue, the proposed method has capability to embed two times the size of the secret image of previous work. A partial encryption strategy is used for the security of the secret image. In addition, a two-dimensional permutation function, torus automorphism, is also introduced in this chapter.


2017 ◽  
Author(s):  
Elham Shahab ◽  
Hadi Abdolrahimpour

Secret sharing approach and in particular Visual Cryptography (VC) try to address the security issues in dealing with images. In fact, VC is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography. VC takes an image (secret) as an input and encrypts (divide) into two or more pieces (shares) that each of them can not reveal any information about the main input. The decryption way in this scenario is done through superimposing shares on top of each other to receive the input image. No computer participation is required, thus showing one of the distinguishing features of VC. It is claimed that VC is a unique technique in the sense that the encrypted message can be decrypted directly by the human visual system.


Author(s):  
Rahul Sharma ◽  
Nitesh Kumar Agrawal ◽  
Ayush Khare ◽  
Arup Kumar Pal

In this paper, the authors have presented a (n, n) extended visual cryptography scheme where n numbers of meaningful shares furnish a visually secret message. Initially they have converted a grayscale image into binary image using dithering method. Afterwards, they have incorporated pixel's eight neighboring connectivity property of secret image during formation of meaningful shares. The scheme is able to generate the shares without extending its size. This approach has enhanced the visual quality of the recovered secret image from n numbers of shares. The scheme has been tested with some images and satisfactory results are achieved. The scheme has improved the contrast of the recovered secret image than a related (n, n) extended visual cryptography scheme.


Author(s):  
Jing Tian ◽  
Weiyu Yu

Visual saliency detection aims to produce saliency map of images via simulating the behavior of the human visual system (HVS). An ant-inspired approach is proposed in this chapter. The proposed approach is inspired by the ant’s behavior to find the most saliency regions in image, by depositing the pheromone information (through ant’s movements) on the image to measure its saliency. Furthermore, the ant’s movements are steered by the local phase coherence of the image. Experimental results are presented to demonstrate the superior performance of the proposed approach.


2021 ◽  
Vol 30 (1) ◽  
pp. 816-835
Author(s):  
Firas Mohammed Aswad ◽  
Ihsan Salman ◽  
Salama A. Mostafa

Abstract Visual cryptography is a cryptographic technique that allows visual information to be encrypted so that the human optical system can perform the decryption without any cryptographic computation. The halftone visual cryptography scheme (HVCS) is a type of visual cryptography (VC) that encodes the secret image into halftone images to produce secure and meaningful shares. However, the HVC scheme has many unsolved problems, such as pixel expansion, low contrast, cross-interference problem, and difficulty in managing share images. This article aims to enhance the visual quality and avoid the problems of cross-interference and pixel expansion of the share images. It introduces a novel optimization of color halftone visual cryptography (OCHVC) scheme by using two proposed techniques: hash codebook and construction techniques. The new techniques distribute the information pixels of a secret image into a halftone cover image randomly based on a bat optimization algorithm. The results show that these techniques have enhanced security levels and make the proposed OCHVC scheme more robust against different attacks. The OCHVC scheme achieves mean squared error (MSE) of 95.0%, peak signal-to-noise ratio (PSNR) of 28.3%, normalized cross correlation (NCC) of 99.4%, and universal quality index (UQI) of 99.3% on average for the six shares. Subsequently, the experiment results based on image quality metrics show improvement in size, visual quality, and security for retrieved secret images and meaningful share images of the OCHVC scheme. Comparing the proposed OCHVC with some related works shows that the OCHVC scheme is more effective and secure.


2017 ◽  
Author(s):  
Elham Shahab ◽  
Hadi Abdolrahimpour

Secret sharing approach and in particular Visual Cryptography (VC) try to address the security issues in dealing with images. In fact, VC is a powerful technique that combines the notions of perfect ciphers and secret sharing in cryptography. VC takes an image (secret) as an input and encrypts (divide) into two or more pieces (shares) that each of them can not reveal any information about the main input. The decryption way in this scenario is done through superimposing shares on top of each other to receive the input image. No computer participation is required, thus showing one of the distinguishing features of VC. It is claimed that VC is a unique technique in the sense that the encrypted message can be decrypted directly by the human visual system.


Sign in / Sign up

Export Citation Format

Share Document