Optimal complexity of secret sharing schemes with four minimal qualified subsets
type: Item
instance of: scholarly article
title: Optimal complexity of secret sharing schemes with four minimal qualified subsets
zbMATH Open document ID: 1236.94079
author: Jaume Martí-Farré
author: Carles Padró
author: Leonor Vázquez
published in: Designs, Codes and Cryptography
publication date: 2011-09-27T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5951140
zbMATH Keywords: secret sharing
zbMATH Keywords: optimization of secret sharing schemes
zbMATH Keywords: general access structures
MaRDI profile type: Publication
full work available at URL: s10623-010-9446-0
OpenAlex ID: W2053888052
cites work: Separating the Power of Monotone Span Programs over Different Fields
cites work: Matroids Can Be Far from Ideal Secret Sharing
cites work: Characterizing Ideal Weighted Threshold Secret Sharing
cites work: Q3202940
cites work: Q4318691
cites work: Graph decompositions and secret sharing schemes
cites work: Tight bounds on the information rate of secret sharing schemes
cites work: On the classification of ideal secret sharing schemes
cites work: Some improved bounds on the information rate of perfect secret sharing schemes
cites work: On the size of shares for secret sharing schemes
cites work: The size of a share must be large
cites work: An impossibility result on graph secret sharing
cites work: On an infinite family of graphs with information ratio \(2 - 1/k\)
cites work: Ideal Hierarchical Secret Sharing Schemes
cites work: Ideal Multipartite Secret Sharing Schemes
cites work: On the Optimization of Bipartite Secret Sharing Schemes
cites work: Polymatroidal dependence structure of a set of random variables
cites work: Geometric secret sharing schemes and their duals
cites work: Perfect secret sharing schemes on five participants
cites work: On secret sharing systems
cites work: Secret sharing schemes with three or four minimal qualified subsets
cites work: Secret sharing schemes on access structures with intersection number equal to one
cites work: On secret sharing schemes, matroids and polymatroids
cites work: Adhesivity of polymatroids
cites work: Secret sharing schemes with bipartite access structure
cites work: Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
cites work: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming
cites work: How to share a secret
cites work: An explication of secret sharing schemes
cites work: Q4318692
cites work: Decomposition constructions for secret-sharing schemes
cites work: On the information rate of perfect secret sharing schemes
cites work: A linear construction of secret sharing schemes
cites work: Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
DOI: 10.1007/S10623-010-9446-0
description: scientific article; zbMATH DE number 5951140