Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-010-9446-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053888052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating the Power of Monotone Span Programs over Different Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids Can Be Far from Ideal Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Ideal Weighted Threshold Secret Sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions and secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the information rate of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the classification of ideal secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some improved bounds on the information rate of perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of shares for secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of a share must be large / rank
 
Normal rank
Property / cites work
 
Property / cites work: An impossibility result on graph secret sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an infinite family of graphs with information ratio \(2 - 1/k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal Hierarchical Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideal Multipartite Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimization of Bipartite Secret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroidal dependence structure of a set of random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric secret sharing schemes and their duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect secret sharing schemes on five participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secret sharing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes with three or four minimal qualified subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes on access structures with intersection number equal to one / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secret sharing schemes, matroids and polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adhesivity of polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes with bipartite access structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explication of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition constructions for secret-sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the information rate of perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear construction of secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions / rank
 
Normal rank

Revision as of 11:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Optimal complexity of secret sharing schemes with four minimal qualified subsets
scientific article

    Statements

    Optimal complexity of secret sharing schemes with four minimal qualified subsets (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2011
    0 references
    secret sharing
    0 references
    optimization of secret sharing schemes
    0 references
    general access structures
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers