Secret sharing schemes on graphs
From MaRDI portal
Publication:3531289
DOI10.1556/SScMath.2007.1021zbMath1164.94008MaRDI QIDQ3531289
Publication date: 22 October 2008
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1556/sscmath.2007.1021
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
68R10: Graph theory (including graph drawing) in computer science
94A60: Cryptography
94A17: Measures of information, entropy
Related Items
Secret-sharing schemes for very dense graphs, Exact information ratios for secret sharing on small graphs with girth at least 5, Secret sharing on the \(d\)-dimensional cube, On an infinite family of graphs with information ratio \(2 - 1/k\), The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs, Secret sharing on large girth graphs, Secret Sharing Schemes for Dense Forbidden Graphs