{'fraction_non_alphanumeric': 0.02882703777335984, 'fraction_numerical': 0.002982107355864811, 'mean_word_length': 5.625, '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}}
Hildht: Hilbert-based SDSI/SPKI certificate storage and relative search algorithm

It is effective to address authorization in decentralized environments by using trust-management (TM) systems. SDSI/SPKI is a proposed public key infrastructure that includes authorization certificates and name certificates. How to store certificates is an important and unsolved problem in SDSI/SPKI system. Unlike X.509, SDSI/SPKI's egalitarian design resists deployment on traditional server hierarchies. We present a peer-to-peer deployment architecture, Hildht, to store SDSI/SPKI's certificates. In this architecture, we use distributed hash table( DHT) and Hilbert SFC to distribute authorization certificates and avoid bottleneck. A new algorithm is put forward to search all relevant authorization certificates which satisfy the query consisting of partial keywords. In addition to this we bring forward a new algorism to discover authorization certificates chain which could create the littlest credential graphs.