DocumentCode :
2645282
Title :
Optimal Constructions of Visual Secret Sharing Schemes for the Graph Access Structure
Author :
Suga, Yuji
Author_Institution :
Internet Initiative Japan Inc., Tokyo, Japan
fYear :
2011
fDate :
June 30 2011-July 2 2011
Firstpage :
634
Lastpage :
638
Abstract :
Visual secret sharing scheme (for short the VSS scheme) with access structure based on graph [1] 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. Namely, 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. In this paper, we expand the definition of black-white visual secret sharing scheme and propose new decomposition methods by splitting complete n-partite graphs. These methods improve the contrast of the decoded secret image. Moreover, we classify graph-based VSS schemes which pixel expansion is up to 3, and show several optimal examples.
Keywords :
cryptography; graph theory; image coding; (2,n)-threshold VSS scheme; black-white visual secret sharing scheme; decomposition method; graph access structure; graph-based VSS scheme; n-partite graph; star graph; Cryptography; Image color analysis; Image reconstruction; Matrix decomposition; Pixel; Symmetric matrices; Visualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2011 Fifth International Conference on
Conference_Location :
Seoul
Print_ISBN :
978-1-61284-733-7
Electronic_ISBN :
978-0-7695-4372-7
Type :
conf
DOI :
10.1109/IMIS.2011.134
Filename :
5976288
Link To Document :
بازگشت