Secret sharing schemes with three or four minimal qualified subsets (Q1766095): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: 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: 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: Geometric secret sharing schemes and their duals / 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: 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: Decomposition constructions for secret-sharing schemes / rank
 
Normal rank

Revision as of 19:08, 7 June 2024

scientific article
Language Label Description Also known as
English
Secret sharing schemes with three or four minimal qualified subsets
scientific article

    Statements

    Secret sharing schemes with three or four minimal qualified subsets (English)
    0 references
    0 references
    0 references
    28 February 2005
    0 references
    cryptography
    0 references
    secret sharing schemes
    0 references
    information rate
    0 references
    ideal schemes
    0 references

    Identifiers