Absolutely secure message transmission using a key sharing graph (Q4903639)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6128411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Absolutely secure message transmission using a key sharing graph |
scientific article; zbMATH DE number 6128411 |
Statements
ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH (English)
0 references
24 January 2013
0 references
message transmission
0 references
key sharing graph
0 references
eavesdropper
0 references
absolutely secure
0 references
2-connected graph
0 references
internally disjoint paths
0 references
tree
0 references
unicast
0 references
multicast
0 references
collusion
0 references
0.853611171245575
0 references
0.7803563475608826
0 references
0.7792072296142578
0 references
0.7709461450576782
0 references
0.770858108997345
0 references
