Secret sharing on the d-dimensional cube

DOI10.1007/S10623-013-9888-2zbMATH Open1342.94106arXiv1310.4640OpenAlexW3098268135MaRDI QIDQ2260799FDOQ2260799

Authors: László Csirmaz 

Publication date: 12 March 2015

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

Abstract: We prove that for $d>1$ the best information ratio of the perfect secret sharing scheme based on the edge set of the $d$-dimensional cube is exactly $d/2$. Using the technique developed, we also prove that the information ratio of the infinite $d$-dimensional lattice is $d$.

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

Recommendations

• On \(d\)-multiplicative secret sharing
• Three-level secret sharing schemes from the twisted cubic
• scientific article; zbMATH DE number 1612523
• scientific article; zbMATH DE number 812038
• scientific article; zbMATH DE number 2020870
• Secret-sharing for \(\mathbf {NP}\)
• On the complexity of arithmetic secret sharing
• Secret sharing based on a hard-on-average problem
• On secret sharing schemes, matroids and polymatroids
• On Secret Sharing Schemes, Matroids and Polymatroids

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)

Cites Work

• Title not available (Why is that?)
• On the classification of ideal secret sharing schemes
• Some improved bounds on the information rate of perfect secret sharing schemes
• On the information rate of perfect secret sharing schemes
• Decomposition constructions for secret-sharing schemes
• Perfect secret sharing schemes on five participants
• Tight bounds on the information rate of secret sharing schemes
• Covering a graph by complete bipartite graphs
• Graph decompositions and secret sharing schemes
• Optimal Information Rate of Secret Sharing Schemes on Trees
• Secret-Sharing Schemes: A Survey
• Secret sharing schemes on graphs
• Secret sharing schemes for very dense graphs
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• Secret sharing on infinite graphs

Cited In (8)

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

This page was built for publication: Secret sharing on the \(d\)-dimensional cube

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