The optimal information rate for graph access structures of nine participants

The information rate is an important metric of the performance of a secret-sharing scheme. In this paper we consider 272 non-isomorphic connected graph access structures with nine vertices and eight or nine edges, and either determine or bound the optimal information rate in each case. We obtain exact values for the optimal information rate for 231 cases and present a method that is able to derive information-theoretical upper bounds on the optimal information rate. Moreover, we apply some of the constructions to determine lower bounds on the information rate. Regarding information rate, we conclude with a full listing of the known optimal information rate (or bounds on the optimal information rate) for all 272 graphs access structures of nine participants.

[1]  K. Martin,et al.  Perfect secret sharing schemes on five participants , 1996 .

[2]  Alfredo De Santis,et al.  On the size of shares for secret sharing schemes , 1991, Journal of Cryptology.

[3]  Carles Padró,et al.  Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming , 2010, LATIN.

[4]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[5]  Marten van Dijk.  On the information rate of perfect secret sharing schemes , 1995, Des. Codes Cryptogr..

[6]  Hai-Dong Yuan,et al.  Secret sharing with multi-cover adaptive steganography , 2014, Inf. Sci..

[7]  Chien-Chang Chen,et al.  A secure Boolean-based multi-secret image sharing scheme , 2014, J. Syst. Softw..

[8]  Hung-Min Sun,et al.  Weighted decomposition construction for perfect secret sharing schemes , 2002 .

[9]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[10]  Lein Harn,et al.  Multilevel threshold secret sharing based on the Chinese Remainder Theorem , 2014, Inf. Process. Lett..

[11]  Yun Song,et al.  The Information Rate of Secret Sharing Schemes on Seven Participants by Connected Graphs , 2012 .

[12]  Yun Song,et al.  The optimal information rate of perfect secret sharing schemes , 2011, 2011 International Conference on Business Management and Electronic Information.

[13]  Massoud Hadian Dehkordi,et al.  The complexity of the graph access structures on six participants , 2013, Des. Codes Cryptogr..

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  Vasif V. Nabiyev,et al.  Secret image sharing scheme with adaptive authentication strength , 2013, Pattern Recognit. Lett..

[16]  WEN-AI JACKSON,et al.  Perfect Secret Sharing Schemes on Five Participants , 1996, Des. Codes Cryptogr..

[17]  Hung-Lin Fu,et al.  New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures , 2013, Inf. Sci..

[18]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[19]  Douglas R Stinson,et al.  Some improved bounds on the information rate of perfect secret sharing schemes , 1990, Journal of Cryptology.