The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
DOI10.1016/J.DAM.2017.08.006zbMath1372.05114OpenAlexW2752991907MaRDI QIDQ2410257
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.08.006
bipartite graphmaximum independent setstar decompositionsecret-sharing schemecomplete multipartite coveringunicycle graphaverage information ratiofractional star covering
Paths and cycles (05C38) Graph theory (05C99) Information theory (general) (94A15) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Secret-sharing schemes for very dense graphs
- On the information rate of secret sharing schemes
- Perfect secret sharing schemes on five participants
- An impossibility result on graph secret sharing
- On the classification of ideal secret sharing schemes
- Some improved bounds on the information rate of perfect secret sharing schemes
- An explication of secret sharing schemes
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Graph decompositions and secret sharing schemes
- On the information rate of perfect secret sharing schemes
- On an infinite family of graphs with information ratio \(2 - 1/k\)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures
- Optimal Information Rate of Secret Sharing Schemes on Trees
- Secret sharing schemes on graphs
- Decomposition constructions for secret-sharing schemes
- New bounds on the information rate of secret sharing schemes
This page was built for publication: The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
