A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination provides cooperative jamming. Channel state information is used at the source and the destination to scale the encoding lattices for the message and the jamming signal according to the channel gains. We compare the achievable secrecy rate of our scheme with an upper bound and with the achievable secrecy rate of other schemes. It follows that our scheme outperforms all existing schemes except in the low power region
We investigate secure communications for a four-node relay-eavesdropper channel with multiple data s...
We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in...
This paper studies cooperative transmission for securing a two-hop network where the eavesdropper ca...
In this paper, we consider communication on a two-hop channel in which a source wants to send inform...
We study the problem of secure bidirectional relaying in the presence of an ``honest but curious'' r...
We study the problem of secure bidirectional relaying in the presence of an ``honest but curious'' r...
We investigate the problem of secure communications in a Gaussian multi-way relay channel applying t...
We consider a source-destination pair that can only communicate through an untrusted intermediate re...
We consider a source-destination pair that can only communicate through an untrusted intermediate r...
We consider the basic bidirectional relaying problem, in which two users in a wireless network wish ...
Abstract In this work, we analyze the secrecy rate in a cooperative network, where a source node is ...
We propose in this paper a physical layer security (PLS) scheme for dual-hop cooperative networks in...
In this work, we study two problems in information-theoretic security. Firstly, we study a wireless...
We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in...
Abstract—This paper proposes a cooperative jamming strategy for two-hop relay networks where the eav...
We investigate secure communications for a four-node relay-eavesdropper channel with multiple data s...
We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in...
This paper studies cooperative transmission for securing a two-hop network where the eavesdropper ca...
In this paper, we consider communication on a two-hop channel in which a source wants to send inform...
We study the problem of secure bidirectional relaying in the presence of an ``honest but curious'' r...
We study the problem of secure bidirectional relaying in the presence of an ``honest but curious'' r...
We investigate the problem of secure communications in a Gaussian multi-way relay channel applying t...
We consider a source-destination pair that can only communicate through an untrusted intermediate re...
We consider a source-destination pair that can only communicate through an untrusted intermediate r...
We consider the basic bidirectional relaying problem, in which two users in a wireless network wish ...
Abstract In this work, we analyze the secrecy rate in a cooperative network, where a source node is ...
We propose in this paper a physical layer security (PLS) scheme for dual-hop cooperative networks in...
In this work, we study two problems in information-theoretic security. Firstly, we study a wireless...
We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in...
Abstract—This paper proposes a cooperative jamming strategy for two-hop relay networks where the eav...
We investigate secure communications for a four-node relay-eavesdropper channel with multiple data s...
We propose in this paper a physical-layer security (PLS) scheme for dual-hop cooperative networks in...
This paper studies cooperative transmission for securing a two-hop network where the eavesdropper ca...