Fig 1.
A left-to-right and top-down policy-based partially ordered set (poset) within the hierarchical structure.
Fig 2.
The classification levels based on taxonomic ranks.
Table 1.
Comparison of principles hierarchical key assignment schemes.
Fig 3.
Orthogonal Projection: The closest vector to
is the
.
In other words, h is the nearest vector to f in W if and only if (f–h) is orthogonal to all vectors in W.
Fig 4.
Steps of the system-ready phase.
Fig 5.
Workflow diagram for the proposed hierarchical key assignment scheme.
Steps 1a and 1b are grouped under the System-Ready Phase, followed by key derivation and dynamic rekeying with compromise detection.
Table 2.
Memory and bandwidth benchmarks during key distribution.
Table 3.
Cost and trust summary for dynamic updates.
Fig 6.
Insertion of into the organization structure.
Fig 7.
BAS with 4 Classification Levels (=c=15).
Fig 8.
BAS with 5 Classification Levels (=c=31).
Fig 9.
TAS with 4 Classification Levels (=c=40).
Fig 10.
TAS with 5 Classification Levels (=c=121).
Table 4.
Comparison with previous schemes.