Exploiting the Homomorphic Property of Visual Cryptography

2017 ◽  
Vol 9 (2) ◽  
pp. 45-56 ◽  
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Song Wan ◽  
Wanmeng Ding ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Signal Processing ◽  
Theoretical Analysis ◽  
Visual System ◽  
Human Visual System ◽  
Visual Cryptography ◽  
Secret Image ◽  
Simulation Results ◽  
Cryptographic Scheme

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.

scholarly journals Exploiting the Homomorphic Property of Visual Cryptography

Cryptography ◽  
2020 ◽  
pp. 416-427
Author(s):  
Xuehu Yan ◽  
Yuliang Lu ◽  
Lintao Liu ◽  
Song Wan ◽  
Wanmeng Ding ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Signal Processing ◽  
Theoretical Analysis ◽  
Visual System ◽  
Human Visual System ◽  
Visual Cryptography ◽  
Secret Image ◽  
Simulation Results ◽  
Cryptographic Scheme

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.

scholarly journals Visual Cryptography Scheme with Essential Participants

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 838 ◽  
Author(s):  
Peng Li ◽  
Liping Yin ◽  
Jianfeng Ma
Keyword(s):  
Integer Programming ◽  
Visual System ◽  
Human Visual System ◽  
Programming Model ◽  
Visual Cryptography ◽  
Optimal Choice ◽  
Experimental Results ◽  
Secret Image ◽  
Visual Cryptography Scheme ◽  
Computational Resources

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.

Hiding Images Using Dynamic Bit-Replacement and Human Visual System

2002 ◽  
pp. 190-205
Author(s):  
Chin-Chen Chang ◽  
Kuo-Feng Hwang
Keyword(s):  
Visual System ◽  
Human Visual System ◽  
Main Idea ◽  
Cover Image ◽  
Two Dimensional ◽  
Hiding Capacity ◽  
Partial Encryption ◽  
Secret Image ◽  
Threshold Mechanism ◽  
Human Eyes

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.

scholarly journals An investigation of visual cryptography and its applications in secure communications

2017 ◽  
Author(s):  
Elham Shahab ◽  
Hadi Abdolrahimpour
Keyword(s):  
Visual System ◽  
Secret Sharing ◽  
Human Visual System ◽  
Visual Cryptography ◽  
Input Image ◽  
Secure Communications ◽  
Security Issues ◽  
Main Input ◽  
To Receive ◽  
Distinguishing Features

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.

Slow Feature Analysis: A Theoretical Analysis of Optimal Free Responses

2003 ◽  
Vol 15 (9) ◽  
pp. 2147-2177 ◽  
Author(s):  
Laurenz Wiskott
Keyword(s):  
Simple Model ◽  
Theoretical Analysis ◽  
Visual System ◽  
Efficient Algorithm ◽  
Optimization Problem ◽  
Feature Analysis ◽  
Slow Feature Analysis ◽  
Input Signals ◽  
Invariant Representations ◽  
Simulation Results

Temporal slowness is a learning principle that allows learning of invariant representations by extracting slowly varying features from quickly varying input signals. Slow feature analysis (SFA) is an efficient algorithm based on this principle and has been applied to the learning of translation, scale, and other invariances in a simple model of the visual system. Here, a theoretical analysis of the optimization problem solved by SFA is presented, which provides a deeper understanding of the simulation results obtained in previous studies.

scholarly journals An investigation of visual cryptography and its applications in secure communications

2017 ◽  
Author(s):  
Elham Shahab ◽  
Hadi Abdolrahimpour
Keyword(s):  
Visual System ◽  
Secret Sharing ◽  
Human Visual System ◽  
Visual Cryptography ◽  
Input Image ◽  
Secure Communications ◽  
Security Issues ◽  
Main Input ◽  
To Receive ◽  
Distinguishing Features

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.

A Visual Hiding Algorithm Based on Human Visual System

2014 ◽  
Vol 989-994 ◽  
pp. 2393-2397
Author(s):  
Rui Dong ◽  
Dao Shun Wang
Keyword(s):  
Visual System ◽  
Human Visual System ◽  
Information Hiding ◽  
Image Information ◽  
Secret Image ◽  
Secret Information ◽  
Texture Information

Image information hiding is a way of concealing secret information within another image or file. The previous researches of image information hiding extract secret by calculating. An algorithm based on HVS (Human Visual System) is proposed in this paper. We first decide the embedding region and embedding strength of secret image based on edge and texture information. Then, a pair of invert images is chosen as the cover images, and the stego images are constructed by modifying the pixels of the cover images through the proposed criterion. Correspondingly, the secret image can be recovered through overlaying the two stego images.

scholarly journals An Enhance Scheme of Visual Secret Share for Lossless Recovery

2020 ◽  
Vol 9 (3S) ◽  
pp. 52-56
Keyword(s):  
Visual Cryptography ◽  
Secret Image ◽  
Lossless Recovery ◽  
Sharing Scheme ◽  
Bitwise Operations ◽  
Cryptographic Scheme

Algorithms in Visual Cryptography usually uses a sharing scheme where instead of sharing the secret or message directly, it is embedded into multiple shares which are then shared between the intended individuals whereby upon receiving them the decrypting algorithm on the receiving end restores the original secret. A novel cryptographic scheme will not only hide the data, but also will do it in an efficient way which will further ensure that the algorithm is robust to noises and attacks. The proposed algorithm utilizes bitwise operations for efficient hiding of data. Also, it is important that the secret image is losslessly recovered.

scholarly journals Secret Image Enhanced Sharing Using Visual Cryptography

2017 ◽  
Vol 17 (3) ◽  
pp. 128-139
Author(s):  
K. Brindha ◽  
N. Jeyanthi
Keyword(s):  
Visual Cryptography ◽  
Individual Member ◽  
Original Image ◽  
Secret Image ◽  
Inherent Risk ◽  
Cryptographic Scheme

Abstract In the conventional visual cryptographic scheme, an image is divided into several image shares, which are distributed among the members of a group, and the original image is retrieved by combining the shares of all the members. This secret image becomes accessible to every individual member and there is an inherent risk of any one of the members in the group using the valuable information for illegal purposes as an intruder. To overcome this problem, the proposed algorithm Secret Image Enhanced Sharing using Visual Cryptography (SIESVC) diligently facilitates any member in the group to retrieve either only a part or the complete secret image based purely on his access privilege rights only.

Sign in / Sign up

Export Citation Format

Share Document