scholarly journals Graph access structures with optimal pixel expansion three

2013 ◽  
Vol 230 ◽  
pp. 67-75
Author(s):  
S. Arumugam ◽  
R. Lakshmanan ◽  
Atulya K. Nagar
Keyword(s):  
Pixel Expansion ◽  
Access Structures ◽  
Graph Access

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.

scholarly journals On the Pixel Expansion of Visual Cryptography Scheme

Cryptography ◽  
2020 ◽  
pp. 537-544
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.

The optimal information rate for graph access structures of nine participants

2015 ◽  
Vol 9 (5) ◽  
pp. 778-787 ◽  
Author(s):  
Yun Song ◽  
Zhihui Li ◽  
Yongming Li ◽  
Ren Xin
Keyword(s):  
Information Rate ◽  
Access Structures ◽  
Optimal Information ◽  
Graph Access

Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

2010 ◽  
Vol 24 (2) ◽  
pp. 617-638 ◽  
Author(s):  
Hung-Min Sun ◽  
Huaxiong Wang ◽  
Bying-He Ku ◽  
Josef Pieprzyk
Keyword(s):  
Polynomial Time ◽  
Secret Sharing ◽  
Secret Sharing Schemes ◽  
Access Structures ◽  
Graph Access

The complexity of the graph access structures on six participants

2011 ◽  
Vol 67 (2) ◽  
pp. 169-173 ◽  
Author(s):  
Motahhareh Gharahi ◽  
Massoud Hadian Dehkordi
Keyword(s):  
Access Structures ◽  
Graph Access

The complexity of the connected graph access structure on seven participants

2017 ◽  
Vol 11 (1) ◽  
pp. 25-35
Author(s):  
Massoud Hadian Dehkordi ◽  
Ali Safi
Keyword(s):  
Lower Bound ◽  
Secret Sharing ◽  
Upper Bound ◽  
Connected Graph ◽  
Access Structure ◽  
Decomposition Techniques ◽  
Induced Subgraph ◽  
Access Structures ◽  
Graph Access

AbstractIn this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of the graph G. Then, applying decomposition techniques, we obtain an upper bound on the complexity of the graph G. We determine the exact values of the complexity for each of the ten graph access structures on seven participants. Also, we improve the value bound of the complexity for the six graph access structures with seven participants.

Sign in / Sign up

Export Citation Format

Share Document