Fully-qualified Names (2)

• SDSI name chain reduction, recursively:

  (name n1 n2 Ö nN) & (name n1) = k1
  
  _ (name n2 Ö nN)

• Identical to the process with X.509

• If there were one naming root, then the root key could be just assumed and not stated.

• There will never be one root, so all attribute certs need FQNs, probably as shown above.

Previous slide

Next slide

Back to first slide

View graphic version