Extended visual cryptography for general access structures using random grids

Author(s):  
Sonu K. Mishra ◽  
Kumar Biswaranjan
1996 ◽  
Vol 129 (2) ◽  
pp. 86-106 ◽  
Author(s):  
Giuseppe Ateniese ◽  
Carlo Blundo ◽  
Alfredo De Santis ◽  
Douglas R. Stinson

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.


2006 ◽  
Vol 16 (4) ◽  
pp. 431-436 ◽  
Author(s):  
Feng Yi ◽  
Daoshun Wang ◽  
Ping Luo ◽  
Liansheng Huang ◽  
Yiqi Dai

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.


Sign in / Sign up

Export Citation Format

Share Document