Random grid based color visual cryptography scheme for black and white secret images with general access structures

2019 ◽  
Vol 75 ◽  
pp. 100-110 ◽  
Author(s):  
Xiaotian Wu ◽  
Zhao-Rong Lai
Author(s):  
Mandru Manisha, Et. al.

Visual Cryptography is an encryption technique which performs only encryption in cryptography, and it is used to encrypt every visual data. And this cryptography is different and unique in all cryptographic techniques, because of not performing decryption process mechanically, and that is done mechanically. In normal visual cryptography only black and white images are encrypted. In this paper we propose a different type of visual cryptography scheme for colour imagesin CMY format. And it protects the secret of the original image and no other techniques does not decrypt it except our decryption technique.


2017 ◽  
Vol 9 (2) ◽  
pp. 38-44 ◽  
Author(s):  
Teng Guo ◽  
Jian Jiao ◽  
Feng Liu ◽  
Wen Wang

In this paper, we first follow Ateniese et al.'s work that provides upper bounds of the pixel expansion of visual cryptography schemes(VCSs) for more kinds of graph access structures, in which we require that a subset of parties can determine the secret if they contain an edge of the graph G. The constructive upper bounds are derived by the graph decomposition technique. Then we generalize Ateniese et al.'s method of comparing the optimal pixel expansion of VCSs with two different access structures.


2013 ◽  
Vol 756-759 ◽  
pp. 1361-1365 ◽  
Author(s):  
Yu Qiao Deng ◽  
Ge Song

This paper proposes a new verifiable visual cryptography scheme for general access structures using pi-sigma neural networks (VVCSPSN), which is based on probabilistic signature scheme (PSS), which is considered as security and effective verification method. Compared to other high-order networks, PSN has a highly regular structure, needs a much smaller number of weights and less training time. Using PSNs capability of large-scale parallel classification, VCSPSN reduces the information communication rate greatly, makes best known upper bound polynomial, and distinguishes the deferent information in secret image.


2014 ◽  
Vol 58 (10) ◽  
pp. 2426-2442 ◽  
Author(s):  
Chunfeng Lian ◽  
Liaojun Pang ◽  
Jimin Liang

2019 ◽  
Author(s):  
Dr. Sheshang Degadwala ◽  
Dhairya Vyas ◽  
Arpana Mahajan

Sign in / Sign up

Export Citation Format

Share Document