The complexity of the connected graph access structure on seven participants (Q515397): 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: 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: Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An impossibility result on graph secret sharing / 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: How to share a secret / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition constructions for secret-sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted decomposition construction for perfect secret sharing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect secret sharing schemes on five participants / rank
 
Normal rank

Revision as of 13:04, 13 July 2024

scientific article
Language Label Description Also known as
English
The complexity of the connected graph access structure on seven participants
scientific article

    Statements

    Identifiers