The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures (Q477568): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to build robust shared control systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal vectors in linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Threshold Multisecret Sharing Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341738 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal linear secret sharing scheme for any given access structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multi-secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear secret sharing schemes and rearrangements of access structures / rank
 
Normal rank

Latest revision as of 10:01, 9 July 2024

scientific article
Language Label Description Also known as
English
The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
scientific article

    Statements

    The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures (English)
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    secret sharing
    0 references
    multi-secret sharing scheme
    0 references
    non-threshold multi-access structure
    0 references
    linear code
    0 references
    complexity
    0 references
    randomness
    0 references

    Identifiers