Visual Cryptography Schemes for Graph Based Access Structures

2013 ◽  
Author(s):  
Stelvio Cimato
Keyword(s):  
Visual Cryptography ◽  
Access Structures

scholarly journals Visual Cryptography for General Access Structures

1996 ◽  
Vol 129 (2) ◽  
pp. 86-106 ◽  
Author(s):  
Giuseppe Ateniese ◽  
Carlo Blundo ◽  
Alfredo De Santis ◽  
Douglas R. Stinson
Keyword(s):  
Visual Cryptography ◽  
Access Structures

On the Pixel Expansion of Visual Cryptography Scheme

2017 ◽  
Vol 9 (2) ◽  
pp. 38-44 ◽  
Author(s):  
Teng Guo ◽  
Jian Jiao ◽  
Feng Liu ◽  
Wen Wang
Keyword(s):  
Visual Cryptography ◽  
Upper Bounds ◽  
Graph Decomposition ◽  
Decomposition Technique ◽  
Pixel Expansion ◽  
Access Structures ◽  
Visual Cryptography Scheme ◽  
Graph Access

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.

Multi secret image color visual cryptography schemes for general access structures *

2006 ◽  
Vol 16 (4) ◽  
pp. 431-436 ◽  
Author(s):  
Feng Yi ◽  
Daoshun Wang ◽  
Ping Luo ◽  
Liansheng Huang ◽  
Yiqi Dai
Keyword(s):  
Visual Cryptography ◽  
Secret Image ◽  
Access Structures

A Verifiable Visual Cryptography Scheme Using Neural Networks

2013 ◽  
Vol 756-759 ◽  
pp. 1361-1365 ◽  
Author(s):  
Yu Qiao Deng ◽  
Ge Song
Keyword(s):  
Neural Networks ◽  
Large Scale ◽  
Visual Cryptography ◽  
Regular Structure ◽  
Signature Scheme ◽  
Information Communication ◽  
Training Time ◽  
Verification Method ◽  
Access Structures ◽  
Visual Cryptography Scheme

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.

scholarly journals Threshold Secret Sharing Scheme for Compartmented Access Structures

Cryptography ◽  
2020 ◽  
pp. 438-448
Author(s):  
P. Mohamed Fathimal ◽  
P. Arockia Jansi Rani
Keyword(s):  
Secret Sharing ◽  
Visual Cryptography ◽  
Secret Sharing Scheme ◽  
Secret Image ◽  
Access Structures ◽  
Sharing Scheme ◽  
Single Host ◽  
Compartmented Access Structures ◽  
Key Features

In the realm of visual cryptography, secret sharing is the predominant method of transmission and reception of secure data. Most of the (n, n) secret sharing schemes suffer from one common flaw — locking of information when the all- n number of receivers are not available for some reason. This paper proposes a new method of compartmented secret sharing scheme where some threshold number of equally privileged from each compartment can retrieve data. This scheme rules out regeneration of secret image at the single compartment thereby eliminating the danger of misusing secret image. The key features of this scheme are: better visual quality of the recovered image with no pixel expansion; non-requirement of half toning of color images; less computational complexity by reconstructing secret through XORing and simple addition of all share images. This scheme is highly beneficial in applications where data has to be stored securely in a database and in cloud computing to synchronize information passed to different groups or clusters from a single host.

Sign in / Sign up

Export Citation Format

Share Document