Classification of Generalized Graph-type (2,n)-Visual Secret Sharing Schemes and Optimal Construction for Multiple Secrets
Yuji Suga · Frontiers in artificial intelligence and applications · 2015
Visual secret sharing scheme with access structure based on graph has been proposed and this can be considered as an extension of (2,n)-threshold VSS scheme. Ateniese et al. showed a decomposition method that we decompose star graphs from a given graph which edges are specified by qualified sets, that is two participants (vertices in a given graph) has a common edge if and only if participants can reconstruct the secret image by stacking the shares each other. This paper classifies graph-based VSS schemes and show several optimal examples and also proposes optimal construction about graph-based VSS scheme for (multiple) q secrets which pixel expansion is less than 3*q.