Classification of Generalized Graph-type (2,n)-Visual Secret Sharing Schemes and Optimal Construction for Multiple Secrets

被引：0

作者：

Suga, Yuji ^{[1
]}

机构：

[1] Internet Initiat Japan Inc, Tokyo, Japan

来源：

INTELLIGENT SYSTEMS AND APPLICATIONS (ICS 2014) | 2015年 / 274卷

关键词：

Visual secret sharing scheme; Induced subgraph; Independent VSS; VISUAL CRYPTOGRAPHY;

D O I：

10.3233/978-1-61499-484-8-746

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：746 / 755

页数：10

共 20 条

[1] Visual cryptography for general access structures [J].

Ateniese, G ;

Blundo, C ;

DeSantis, A ;

Stinson, DR .

INFORMATION AND COMPUTATION, 1996, 129 (02) :86-106

[2] On the contrast in visual cryptography schemes [J].

Blundo, C ;

De Santis, A ;

Stinson, DR .

JOURNAL OF CRYPTOLOGY, 1999, 12 (04) :261-289

[3]

Blundo C., 1992, EUROCRYPT 92, V658, P1

[4]

Choi C., 1997, SITA97, V20, P217

[5]

Devi E. Sangeetha, 2010, 2010 International Conference on Communication Control and Computing Technologies, P769

[6]

Droste S., 1996, CRYPTO 96 P 16 ANN I, P401

[7]

GAP - Groups, ALG PROGR SYST COMP

[8]

Iwamoto M., 2008, INT S INF THEOR ITS

[9]

Iwamoto M., 2001, VISUAL SECRET SHARIN, P565

[10]

Kat oh T, 1996, IEICE T A, VJ79-A, P1344

← 1 2 →