Optimal tree structure with loyal users and batch updates (Q411208): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Optimizing deletion cost for secure multicast key management / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Tree Structures for Group Key Management with Batch Updates / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A lower bound for multicast key distribution / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Key Tree Structure for Deleting Two or More Leaves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal tree structures for group key tree management considering insertion and deletion cost / rank | |||
Normal rank | |||
Revision as of 00:56, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal tree structure with loyal users and batch updates |
scientific article |
Statements
Optimal tree structure with loyal users and batch updates (English)
0 references
4 April 2012
0 references
key trees
0 references
group keys
0 references
optimality
0 references
probability
0 references
updating cost
0 references
