{'fraction_non_alphanumeric': 0.013530135301353014, 'fraction_numerical': 0.0024600246002460025, 'mean_word_length': 5.120300751879699, '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 Flexible Approach to Measuring Network Security Using Attack Graphs

The previous approaches to measuring network security are most based on the hypothesis that the related source data can be known well and truly. But in practice, it is very difficult to obtain all the related accurate source data [22]. In this paper, we propose a flexible approach based on attack graphs to measuring security of crucial resources in vulnerable network, which could bring out the accurate result of measuring network security with incomplete input data. Another key improvement is presenting the backward iterative algorithm to solve the problem of cyclic attack paths in measuring security using attack graphs. At the same time, the simulation experiment demonstrates the algorithm can be applied to the large attack graphs.