{'fraction_non_alphanumeric': 0.02702702702702703, 'fraction_numerical': 0.0, 'mean_word_length': 4.716049382716049, '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}}
On secure degrees of freedom for three-user MISO broadcast channel with three messages

We study a three-user multiple-input single-output (MISO) broadcast channel with confidential messages (BCCM). We have three messages where each of them is intended to the corresponding receiver. We impose confidentiality constraints for two of the messages at the receiving terminals. Half of the time, the channel state information (CSI) of all receivers are known perfectly at the transmitter. At the other half, the CSI of one of the receivers is available with some delay. The main contribution of this paper is to find the sum secure degrees of freedom (SDoF) of the proposed channel. We utilize the alternating CSIT scheme to design the precoding matrices. The proof of the converse is challenging for this model. The idea of the converse proof is to adapt the well known statistical equivalent property (SEP) lemma for our model.