{'fraction_non_alphanumeric': 0.018884892086330936, 'fraction_numerical': 0.00539568345323741, 'mean_word_length': 5.183333333333334, '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}}
A centralized key management scheme for hierarchical access control

Key management schemes are used to provide access control to data streams for legitimate users. The users often have certain partially ordered relations, while data streams also form some partially ordered relations. Previous key management schemes have failed to take into consideration either the user relations or data stream relations. We propose a centralized key management scheme for hierarchical access control that considers both partially ordered users and partially ordered data streams. Our scheme improves the efficiency of key management by encrypting multiple equivalent data streams with a single data encryption key, instead of encrypting each data stream with a unique data encryption key in the multi-group key management scheme (Sun, Y. and Ray Liu, K.J., IEEE INFOCOM, 2004). We develop a simulation model to evaluate the performance of our proposed scheme. Simulation results show that our scheme reduces at least 20% of storage overhead at every user and rekey overhead compared to the multi-group key management scheme.