Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs (Q897709)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs |
scientific article |
Statements
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs (English)
0 references
7 December 2015
0 references
key predistribution
0 references
communication graph
0 references
0.86625826
0 references
0.8370025
0 references
0.8282732
0 references
0.8252205
0 references
0.82284796
0 references
0.8227309
0 references
0.8224475
0 references
