Matroids Can Be Far from Ideal Secret Sharing (Q5445507): 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/978-3-540-78524-8_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1509869316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universally ideal secret-sharing schemes / rank
 
Normal rank
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: On secret sharing schemes / 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: 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: Secret sharing over infinite domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / 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: Q3126447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks, Matroids, and Non-Shannon Information Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for representability and transversality of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On secret sharing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934704 / 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: 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: Two Constructions on Limits of Entropy Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / 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: Q4853712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost affine codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dual of the Notion of “Finitely Generated” / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterization of entropy function via information inequalities / rank
 
Normal rank

Latest revision as of 18:19, 27 June 2024

scientific article; zbMATH DE number 5242855
Language Label Description Also known as
English
Matroids Can Be Far from Ideal Secret Sharing
scientific article; zbMATH DE number 5242855

    Statements

    Matroids Can Be Far from Ideal Secret Sharing (English)
    0 references
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    0 references
    0 references