How to compartment secrets

Secret sharing splits a secret s into \(\ell \) shares in such a way that \(k\le \ell \) shares suffice to reconstruct s. Let \(\rho _{i,j}\) be the probability that shareholder i disclose their share to shareholder j, with \(0 \le i,j < n\).

[1]  Kouya Tochikubo,et al.  New Secret Sharing Schemes Realizing General Access Structures , 2015, J. Inf. Process..

[2]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[3]  Ed Dawson,et al.  The breadth of Shamir's secret-sharing scheme , 1994, Comput. Secur..

[4]  Maurice Mignotte,et al.  How to Share a Secret? , 1982, EUROCRYPT.

[5]  Yuval Ishai,et al.  On the Local Leakage Resilience of Linear Secret Sharing Schemes , 2018, Journal of Cryptology.

[6]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[7]  Sihem Mesnager,et al.  Secret Sharing Schemes with General Access Structures , 2015, Inscrypt.