Secret sharing on the \(d\)-dimensional cube

DOI10.1007/s10623-013-9888-2zbMath1342.94106arXiv1310.4640OpenAlexW3098268135MaRDI QIDQ2260799

László Csirmaz

Publication date: 12 March 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

information theorypolymatroidsecret sharing scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Related Items (7)

Optimal linear secret sharing schemes for graph access structures on six participants ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ Local bounds for the optimal information ratio of secret sharing schemes ⋮ Bipartite secret sharing and staircases ⋮ Secret sharing on regular bipartite access structures ⋮ On the information ratio of graphs without high-degree neighbors ⋮ Reduced access structures with four minimal qualified subsets on six participants

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect secret sharing schemes on five participants
• On the classification of ideal secret sharing schemes
• 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
• 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
• 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 the \(d\)-dimensional cube