The lower bound and exact value of the information rate of some developed graph access structures (Q5145937): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: The complexity of the graph access structures on six participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect secret sharing schemes for graph access structures on six participants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact information ratios for secret sharing on small graphs with girth at least 5 / 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: New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures / 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: Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the information rate of perfect secret sharing schemes / rank
 
Normal rank

Revision as of 09:04, 24 July 2024

scientific article; zbMATH DE number 7300011
Language Label Description Also known as
English
The lower bound and exact value of the information rate of some developed graph access structures
scientific article; zbMATH DE number 7300011

    Statements

    Identifiers