The complexity of the connected graph access structure on seven participants

Abstract In this paper, we study an important problem in secret sharing that determines the exact value or bound for the complexity. First, we use the induced subgraph complexity of the graph G with access structure Γ to obtain a lower bound on the complexity of the graph G. Then, applying decomposition techniques, we obtain an upper bound on the complexity of the graph G. We determine the exact values of the complexity for each of the ten graph access structures on seven participants. Also, we improve the value bound of the complexity for the six graph access structures with seven participants.

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

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

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

[4]  Alfredo De Santis,et al.  Graph decompositions and secret sharing schemes , 2004, Journal of Cryptology.

[5]  Ernest F. Brickell,et al.  On the classification of ideal secret sharing schemes , 1989, Journal of Cryptology.

[6]  László Csirmaz,et al.  An impossibility result on graph secret sharing , 2009, Des. Codes Cryptogr..

[7]  Douglas R. Stinson,et al.  Decomposition constructions for secret-sharing schemes , 1994, IEEE Trans. Inf. Theory.

[8]  Zhihui Li,et al.  The optimal information rate for graph access structures of nine participants , 2015, Frontiers of Computer Science.

[9]  Ernest F. Brickell,et al.  Some improved bounds on the information rate of perfect secret sharing schemes , 2006, Journal of Cryptology.

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

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

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

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

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

[15]  ME Marten.  Secret key sharing and secret key generation , 1997 .