Secret sharing schemes with three or four minimal qualified subsets

DOI10.1007/s10623-003-4192-1zbMath1074.94013OpenAlexW2148623656MaRDI QIDQ1766095

Carles Padró, Jaume Martí-Farré

Publication date: 28 February 2005

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

Full work available at URL: https://doi.org/10.1007/s10623-003-4192-1

zbMATH Keywords

cryptographyinformation ratesecret sharing schemesideal schemes

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (20)

Ideal secret sharing schemes on graph-based $3$-homogeneous access structures ⋮ Secret-sharing schemes for very dense graphs ⋮ Optimal linear secret sharing schemes for graph access structures on six participants ⋮ A note on secret sharing schemes with three homogeneous access structure ⋮ Improving the linear programming technique in the search for lower bounds in secret sharing ⋮ On an infinite family of graphs with information ratio \(2 - 1/k\) ⋮ Approximation and decomposition in lattices of clutters ⋮ Secret Sharing Schemes for (k, n)-Consecutive Access Structures ⋮ Complexity of universal access structures ⋮ Ideal multipartite secret sharing schemes ⋮ A generalized information theoretical model for quantum secret sharing ⋮ Exact information ratios for secret sharing on small graphs with girth at least 5 ⋮ Secret sharing schemes on access structures with intersection number equal to one ⋮ Optimal complexity of secret sharing schemes with four minimal qualified subsets ⋮ On secret sharing schemes, matroids and polymatroids ⋮ Reduced access structures with four minimal qualified subsets on six participants ⋮ Matroids Can Be Far from Ideal Secret Sharing ⋮ Ideal secret sharing schemes whose minimal qualified subsets have at most three participants ⋮ Hypergraph decomposition and secret sharing ⋮ An impossibility result on graph secret sharing

Cites Work

• Unnamed Item
• Some improved bounds on the information rate of perfect secret sharing schemes
• An explication of secret sharing schemes
• On the size of shares for secret sharing schemes
• Geometric secret sharing schemes and their duals
• Tight bounds on the information rate of secret sharing schemes
• Graph decompositions and secret sharing schemes
• Secret sharing schemes with bipartite access structure
• How to share a secret
• Decomposition constructions for secret-sharing schemes

This page was built for publication: Secret sharing schemes with three or four minimal qualified subsets