Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (Q1009166): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202940 / 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: Q4318691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204100 / 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: 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: Ideal Multipartite Secret Sharing Schemes / 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: A Solution of the Shannon Switching Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secret sharing schemes on sparse homogeneous access structures with rank three / 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: A note on secret sharing schemes with three homogeneous access structure / 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: Matroid representations by partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / 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: A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secret-sharing matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost affine codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explication of secret sharing schemes / rank
 
Normal rank

Latest revision as of 10:04, 1 July 2024

scientific article
Language Label Description Also known as
English
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
scientific article

    Statements

    Ideal secret sharing schemes whose minimal qualified subsets have at most three participants (English)
    0 references
    0 references
    0 references
    31 March 2009
    0 references
    0 references
    0 references