Guaranteeing Information Transfer Integrity Through Two Non-Colluding Malicious Nodes Against iid Attacks

X Zheng, R Cao, H Gao, Y Lu - IEEE Transactions on Vehicular …, 2020 - ieeexplore.ieee.org
This paper considers channel coding problems with the requirement of guaranteeing
information integrity in the presence of malicious relays (MRs). The proved random channel …

Secrecy transmission on parallel channels: Theoretical limits and performance of practical codes

M Baldi, F Chiaraluce, N Laurenti… - IEEE Transactions …, 2014 - ieeexplore.ieee.org
We consider a system where an agent (Alice) aims at transmitting a message to a second
agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) …

Reliable and perfectly secret communication over the generalized Ozarow-Wyner's wire-tap channel

G Aliberti, R Di Pietro, S Guarino - Computer Networks, 2016 - Elsevier
In a typical secure communication system, messages undergo two different encodings: an
error-correcting code is applied at the physical layer to ensure correct reception by the …

The wiretapped diamond-relay channel

SH Lee, A Khisti - IEEE Transactions on Information Theory, 2018 - ieeexplore.ieee.org
In this paper, we study a diamond-relay channel where the source is connected to M relays
through orthogonal links and the relays transmit to the destination over a wireless multiple …

Multi-terminal networks with an untrusted relay

AA Zewail, M Nafea, A Yener - 2014 52nd Annual Allerton …, 2014 - ieeexplore.ieee.org
This paper investigates the impact of cooperation with an untrusted relay in multi-source
multi-destination networks. The set up considered is one where the relay is the only means …

A coding approach to guarantee information integrity against a Byzantine relay

E Graves, TF Wong - 2013 IEEE International Symposium on …, 2013 - ieeexplore.ieee.org
This paper presents a random coding scheme with which two nodes can exchange
information with guaranteed integrity over a two-way Byzantine relay. This coding scheme is …

Secrecy transmission on block fading channels: Theoretical limits and performance of practical codes

M Baldi, M Bianchi, F Chiaraluce, N Laurenti… - arXiv preprint arXiv …, 2013 - arxiv.org
We consider a system where an agent (Alice) aims at transmitting a message to a second
agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) …

An achievable secrecy throughput of hybrid-ARQ protocols for block fading channels

X Tang, R Liu, P Spasojevic - 2007 IEEE International …, 2007 - ieeexplore.ieee.org
In applications of wireless packet-oriented data networks, a special coding scheme, the
hybrid automatic retransmission request (HARQ) exhibits high throughput efficiency by …

Degraded Gaussian diamond–wiretap channel

SH Lee, A Khisti - IEEE Transactions on Communications, 2015 - ieeexplore.ieee.org
We establish upper and lower bounds on the secrecy capacity of the degraded Gaussian
diamond-wiretap channel, and identify several ranges of channel parameters where these …

Concatenated coding and hybrid automatic repeat request for wiretap channels

S Kim, GK Nguyen, TM Hoang, H Shin - IET Communications, 2014 - Wiley Online Library
In this study, the authors propose an equivocation scheme for wiretap channels, which is
composed of bit‐extension mapping, coset coding and hybrid automatic repeat request …