{'fraction_non_alphanumeric': 0.01804123711340206, 'fraction_numerical': 0.0, 'mean_word_length': 4.9743589743589745, '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}}
Leaking Rate Region to Eavesdroppers and Untrusted Relays

The trustworthiness of nodes in a network is practically a complicated concept and strongly depends on the social relationship among the nodes. For a certain model of trustworthiness, the scheme can be optimized to achieve the highest average secrecy rate based on pre-defined information about possibly malicious nodes. In such a scheme, the secrecy rate is considered as a function of the maximum achievable rate (MAR) at the destination, the MAR at the malicious nodes and the corresponding probabilities. However, in some cases, the trustworthiness model is not available, for example, an engineer does not know if a certain node is maliciously eavesdropping, such a function cannot be derived. Consequently, we need to consider the performance of a scheme in a wide range of trustworthiness levels. To evaluate the performance for such a case, in this paper, we propose a novel concept for comparing these leaking rates which is called leaking rate region. We derive the closed form of leaking rate region for the case of two untrusted relays with multiple antennas at the source and the destination.