Guaranteeing Information Transfer Integrity Through Two Non-Colluding Malicious Nodes Against i.i.d. Attacks

This paper considers channel coding problems with the requirement of guaranteeing information integrity in the presence of malicious relays (MRs). The proved random channel coding scheme yields to an achievable rate formula which is identical to its counterpart obtained in the non-MRs system as long as a non-manipulable condition is satisfied. No pre-shared secret or secret transmission is needed for the proved scheme. Hence the obtained rate is generally larger than those achieved based on secret transmission schemes. In addition, we further prove that the systems with binary symmetric channels (BSCs) and binary erasure channels (BECs) are readily to satisfy the non-manipulable condition. Simulations based on turbo codes are also presented. The results indicate that our theoretical work is still available to practical channel codes.