{'fraction_non_alphanumeric': 0.010615711252653927, 'fraction_numerical': 0.0, 'mean_word_length': 5.742857142857143, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Deconstructing Trust Management

We present soundness and completeness theorems for our earlier work on modeling trust management systems. We then investigate the addition of distributed structured naming to the model, and prove that naming and authorization are orthogonal in a precise sense. The orthogonality theorem gives us soundness and completeness theorems for the entire system, in effect yielding a clean decomposition between naming and authorization concerns.