Exact information ratios for secret sharing on small graphs with girth at least 5

DOI10.1515/JMC-2018-0024MaRDI QIDQ2003345zbMATH OpenOpenAlexWikidataFDO

Authors Károly Harsányi, Péter Ligeti

Publication date 8 July 2019

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1515/jmc-2018-0024

zbMATH Keywords

information ratiograph coveringsecret sharing

Mathematics Subject Classification ID

Applications of graph theory (05C90) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• Tight bounds on the information rate of secret sharing schemes
• The share size of secret-sharing schemes for almost all access structures and graphs
• New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures
• Local bounds for the optimal information ratio of secret sharing schemes
• On the information rate of secret sharing schemes
• scientific article; zbMATH DE number 708803
• Secret sharing on large girth graphs
• On the information ratio of non-perfect secret sharing schemes
• On the information rate of perfect secret sharing schemes

Cites work

• Breaking the circuit-size barrier in secret sharing
• Covering a graph by complete bipartite graphs
• Decomposition constructions for secret-sharing schemes
• Erdős-Pyber theorem for hypergraphs and secret sharing
• Graph decompositions and secret sharing schemes
• How to share a secret
• Improving the linear programming technique in the search for lower bounds in secret sharing
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• On the information rate of perfect secret sharing schemes
• Optimal Information Rate of Secret Sharing Schemes on Trees
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• Perfect secret sharing schemes on five participants
• Secret sharing schemes for very dense graphs
• Secret sharing schemes on graphs
• Secret sharing schemes with three or four minimal qualified subsets
• Some improved bounds on the information rate of perfect secret sharing schemes
• The complexity of the connected graph access structure on seven participants
• Tight bounds on the information rate of secret sharing schemes
• Weighted decomposition construction for perfect secret sharing schemes

Cited in

(8)

• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• The lower bound and exact value of the information rate of some developed graph access structures
• On the information ratio of graphs without high-degree neighbors
• Secret sharing based on Cartesian product of graphs
• Secret sharing on large girth graphs
• On the information ratio of graphs with many leaves
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Optimal linear secret sharing schemes for graph access structures on six participants

This page was built for publication: Exact information ratios for secret sharing on small graphs with girth at least 5

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