Secret sharing on large girth graphs

DOI10.1007/s12095-018-0338-xzbMath1412.94166arXiv1705.10520OpenAlexW2964081642MaRDI QIDQ2632835

László Csirmaz, Péter Ligeti

Publication date: 15 May 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.10520

zbMATH Keywords

girthsecret sharinginformation ratio

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Erdős-Pyber theorem for hypergraphs and secret sharing
• 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
• 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\)
• Optimal Information Rate of Secret Sharing Schemes on Trees
• Secret-Sharing Schemes: A Survey
• Secret sharing schemes on graphs
• Decomposition constructions for secret-sharing schemes

This page was built for publication: Secret sharing on large girth graphs