The optimal information rate of perfect secret sharing schemes

Author

Wang, Weicong ; Li, Zhihui ; Song, Yun

Author_Institution

Coll. of Math. & Inf. Sci., Shaanxi Normal Univ., Xi´´an, China

Volume

2

fYear

2011

fDate

13-15 May 2011

Firstpage

207

Lastpage

212

Abstract

In this paper, the optimal information rate of the graph-based access structures with 7 vertices and 9 or 10 edges is researched, as well as the construction methods of perfect secret sharing schemes with optimal information rate. There are 222 non-isomorphic connected graph-based access structures of this type, which have been studied one by one. The exact values of the optimal information rate of 98 graph-based access structures of them have been determined through precise calculation. Also, the construction methods of perfect secret sharing schemes with optimal information rate have been presented. Except the 98 graph-based access structures, the lower and upper bounds of the optimal information rate of the rest 124 access structures have been determined.

Keywords

cryptography; graph theory; nonisomorphic connected graph-based access structure; optimal information rate; perfect secret sharing scheme; Cryptography; Entropy; Equations; High definition video; Information rates; Random variables; Vectors; edge; graph-based access structure; optimal information rate; perfect secret sharing scheme; vertex;

fLanguage

English

Publisher

ieee

Conference_Titel

Business Management and Electronic Information (BMEI), 2011 International Conference on

Conference_Location

Guangzhou

Print_ISBN

978-1-61284-108-3

Type

conf

DOI

10.1109/ICBMEI.2011.5917883

Filename

5917883