{'fraction_non_alphanumeric': 0.022665457842248413, 'fraction_numerical': 0.0, 'mean_word_length': 5.773006134969325, '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}}
Applying Byzantine Agreement Protocols to the Intrusion Detection Problem in Distributed Systems

"Fixed fortifications are monuments to the stupidity of man" General George Patton, Jr. Solutions to the Byzantine General Problem are applied to the design of an Intrusion Detection & Countermeasure Systems, called SAFE, being developed at the Worcester Polytechnic Institute System Security Research Laboratory (WSSRL). As described in this paper, Byzantine Agreement Protocols (BAP) arrived at a consensus on (identify) which nodes have been compromised, through the use of a series of synchronized, secure rounds of message exchanges. Having arrived at such consensus, offending or compromised nodes are isolated and countermeasure actions initiated by the system. Specifically, we consider in this manuscript the necessary and sufficient conditions for the application of Byzantine Agreement Protocols to the intrusion detection problem. In addition, the set of necessary assumptions needed for the BAP protocol to operate correctly, such as the need for a secure communication channel, are presented