Secret Sharing Schemes Based on Graphical Codes

DOI码：

10.1007/s12095-013-0092-z

发表刊物：

Cryptography and Communications-Discrete-Structures Boolean Functions and Sequences

关键字：

Secret sharing;Linear code;Matroid;Graph

摘要：

We study the access structure and multiplicativity of linear secret sharing schemes based on codes from complete graphs. First, we describe the access structure of the schemes based on cut-set and cycle codes. Second, we show that the class of access structures based on odd cycles cannot be realized by ideal multiplicative linear secret sharing schemes over any finite field. This can be seen as a contribution to the characterization of access structures of ideal multiplicative schemes. The access structure based on odd cycles corresponds to the scheme based on the dual of the extended cycle code. Finally, we show that we can obtain ideal multiplicative linear secret sharing scheme based on the dual of an augmented extended cycle code.

合写作者：

Romar dela Cruz

第一作者：

Ying Gao

论文类型：

期刊论文

通讯作者：

Ying Gao

卷号：

6

期号：

2

页面范围：

137-155

ISSN号：

1936-2447

是否译文：

否

发表时间：

2013-10-19