On an infinite family of graphs with information ratio 2 - 1/k

DOI10.1007/S00607-009-0039-6MaRDI QIDQ2390949zbMATHOpenAlexFDO

Authors László Csirmaz, Péter Ligeti

Publication date 10 August 2009

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-009-0039-6

zbMATH Keywords

entropygraph theoryinformation ratioaccess structuresecret sharing scheme

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• On the information ratio of graphs without high-degree neighbors
• Exact information ratios for secret sharing on small graphs with girth at least 5
• On the information ratio of graphs with many leaves
• Secret sharing on infinite graphs
• An impossibility result on graph secret sharing

Cites work

• scientific article; zbMATH DE number 3908323 (Why is no real title available?)
• An explication of secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Graph decompositions and secret sharing schemes
• How to share a secret
• Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
• Matroid representations by partitions
• On the information rate of perfect secret sharing schemes
• On the size of shares for secret sharing schemes
• Perfect secret sharing schemes on five participants
• Secret sharing schemes on graphs
• Secret sharing schemes with three or four minimal qualified subsets
• The size of a share must be large
• Theory of Cryptography
• Tight bounds on the information rate of secret sharing schemes

Cited in

(14)

• On the information ratio of graphs with many leaves
• On the information ratio of graphs without high-degree neighbors
• An impossibility result on graph secret sharing
• Exact information ratios for secret sharing on small graphs with girth at least 5
• Secret sharing on large girth graphs
• On the optimization of bipartite secret sharing schemes
• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• Secret sharing based on Cartesian product of graphs
• Secret sharing on the \(d\)-dimensional cube
• Secret sharing on infinite graphs
• The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
• Information Measures of Frequency Distributions with an Application to Labeled Graphs
• Graph information ratio

Describes a project that uses

Uses Software

• GLPK

This page was built for publication: On an infinite family of graphs with information ratio \(2 - 1/k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390949)