Optimal complexity of secret sharing schemes with four minimal qualified subsets

DOI10.1007/S10623-010-9446-0MaRDI QIDQ717150zbMATH OpenOpenAlexFDO

Authors Jaume Martí-Farré, Carles Padró, Leonor Vázquez

Publication date 27 September 2011

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

Full work available at URL https://doi.org/10.1007/s10623-010-9446-0

zbMATH Keywords

secret sharinggeneral access structuresoptimization of secret sharing schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secret sharing schemes with three or four minimal qualified subsets
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
• Complexity of universal access structures
• On secret sharing schemes, matroids and polymatroids
• Finding lower bounds on the complexity of secret sharing schemes by linear programming

Cites work

• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 708803 (Why is no real title available?)
• scientific article; zbMATH DE number 708804 (Why is no real title available?)
• A linear construction of secret sharing schemes
• Adhesivity of polymatroids
• An explication of secret sharing schemes
• An impossibility result on graph secret sharing
• Characterizing Ideal Weighted Threshold Secret Sharing
• Decomposition constructions for secret-sharing schemes
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
• Geometric secret sharing schemes and their duals
• Graph decompositions and secret sharing schemes
• How to share a secret
• Ideal Multipartite Secret Sharing Schemes
• Ideal hierarchical secret sharing schemes
• Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
• Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
• Matroids Can Be Far from Ideal Secret Sharing
• On an infinite family of graphs with information ratio \(2 - 1/k\)
• On secret sharing schemes, matroids and polymatroids
• On secret sharing systems
• On the Optimization of Bipartite Secret Sharing Schemes
• On the classification of ideal secret sharing schemes
• On the information rate of perfect secret sharing schemes
• On the size of shares for secret sharing schemes
• Perfect secret sharing schemes on five participants
• Polymatroidal dependence structure of a set of random variables
• Secret sharing schemes on access structures with intersection number equal to one
• Secret sharing schemes with bipartite access structure
• Secret sharing schemes with three or four minimal qualified subsets
• Separating the Power of Monotone Span Programs over Different Fields
• Some improved bounds on the information rate of perfect secret sharing schemes
• The size of a share must be large
• Tight bounds on the information rate of secret sharing schemes

Cited in

(9)

• Complexity of universal access structures
• Exact information ratios for secret sharing on small graphs with girth at least 5
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Reduced access structures with four minimal qualified subsets on six participants
• Secret sharing schemes with three or four minimal qualified subsets
• On the optimization of bipartite secret sharing schemes
• Optimal linear secret sharing schemes for graph access structures on six participants
• The complexity of the connected graph access structure on seven participants

This page was built for publication: Optimal complexity of secret sharing schemes with four minimal qualified subsets

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