{'fraction_non_alphanumeric': 0.032599837000814993, 'fraction_numerical': 0.014669926650366748, 'mean_word_length': 5.079207920792079, '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 New CR-Chord Based P2P Protocol in the Presence of Malicious Nodes

As is known, P2P networks work differently from traditional server-client architecture. Each node can act both a server and a client role. Traditional structural P2P systems are not architectures developed with security in the foreground. Therefore, there are many security vulnerabilities, and when malicious nodes are present in the system, P2P can adversely affect the functioning of the system. With the proposed method, secure nodes are kept in a specific table, taking into account the security gaps in structured peer-to-peer (P2P) networks, and subsequent queries are made over these secure nodes. In addition to the CR-Chord algorithm, half cycles were used to find more reliable cycles in dense malicious environments and increase lookup performance. This enabled P2P network to operate more robust. The lookup performance of the developed method was compared with Cyclic-Routing Chord algorithm in OverSim simulation environment. According to the obtained results, the developed Half Cyclic Routing Chord (HCR-Chord) algorithm was observed to give better results. Keywords: P2P Networks, Chord, Malicious Node, HCR-Chord DOI: 10.7176/JSTR/5-12-31