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

DOI10.1515/jmc-2018-0024zbMath1443.94092OpenAlexW2917729411WikidataQ128410330 ScholiaQ128410330MaRDI QIDQ2003345

Károly Harsányi, Péter Ligeti

Publication date: 8 July 2019

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

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

zbMATH Keywords

graph coveringsecret sharinginformation ratio

Mathematics Subject Classification ID

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

Related Items (1)

The lower bound and exact value of the information rate of some developed graph access structures

Cites Work

• Erdős-Pyber theorem for hypergraphs and secret sharing
• The complexity of the connected graph access structure on seven participants
• Perfect secret sharing schemes on five participants
• Optimal complexity of secret sharing schemes with four minimal qualified subsets
• Some improved bounds on the information rate of perfect secret sharing schemes
• Tight bounds on the information rate of secret sharing schemes
• Covering a graph by complete bipartite graphs
• Weighted decomposition construction for perfect secret sharing schemes
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Secret sharing schemes with three or four minimal qualified subsets
• 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\)
• Secret Sharing Schemes for Very Dense Graphs
• Optimal Information Rate of Secret Sharing Schemes on Trees
• How to share a secret
• Secret sharing schemes on graphs
• Decomposition constructions for secret-sharing schemes
• Breaking the circuit-size barrier in secret sharing

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