End-to-End Secure Multi-Hop Communication with Untrusted Relays

He, Xiang; Yener, Aylin

doi:10.1109/twc.2012.120412.101358

Cited by 53 publications

(55 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In such a network, one can again ask the question whether secure communication between the source and the relay is possible. Reference [68] considered this multi-hop line network, where a source node aims to communicate securely with a destination via a chain of untrusted relays, and found a secrecy rate that is independent of the number of untrusted relays in the network. This result is surprising in that it states that enlisting the cooperation from many untrusted nodes does not penalize the system from the perspective of secure communication.…”

Section: Untrusted Multi-hop Channelmentioning

confidence: 99%

“…The need for a new achievable scheme, different from the one in [64], follows from the fact that applying a scheme based on compressand-forward in the line network leads to accumulation of the quantization noise over the hops, and one would end up with an achievable secrecy rate that decreases dramatically as the number of hops increases, eventually with vanishing end-to-end secrecy rate. To overcome this limitation, [68] proposes an achievable secrecy scheme based on the compute-and-forward strategy [56], [57].…”

Section: Untrusted Multi-hop Channelmentioning

confidence: 99%

See 1 more Smart Citation

Wireless Physical-Layer Security: Lessons Learned From Information Theory

2015

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Untrusted Multi-hop Channelmentioning

confidence: 99%

Section: Untrusted Multi-hop Channelmentioning

confidence: 99%

Wireless Physical-Layer Security: Lessons Learned From Information Theory

2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…For example, the algorithm of [37] can be easily extended to solve Eq. (17). We used this algorithm to provide the simulation results in Section VI.…”

Section: Relay Strategymentioning

confidence: 99%

“…The destination node can help the source node by jamming the relay node with a random signal. This model is extended in [17] to a multi-hop line network.…”

mentioning

confidence: 99%

Weak Secrecy in the Multiway Untrusted Relay Channel With Compute-and-Forward

Richter

Scheunert

Engelmann

et al. 2015

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme under usage of nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme.We start with the general case of the single-input multipleoutput (SIMO) L-user multi-way relay channel and provide an achievable secrecy rate region under a weak secrecy criterion. We show that the securely achievable sum rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. Particularly, we show that all nodes must encode their messages such that the common computation rate tuple falls outside the MAC capacity region of the relay. We provide results for the single-input single-output (SISO) and the multiple-input single-input (MISO) L-user multi-way relay channel as well as the two-way relay channel. We discuss these results and show the dependency between channel realization and achievable secrecy rate. We further compare our result to available results in the literature for different schemes and show that the proposed scheme operates close to the compute-andforward rate without secrecy.

show abstract

“…In contrast, secure physical layer network coding is a method to securely transmit a message by a combination of coding operation on nodes when the network is given as a set of noisy channels. In this paper, we give several examples of network, in which, secure physical layer network coding has advantage over secure network coding.only secure computation-and-forward, which is a method to securely transmit the modulo sum of two input message when noisy multiple access channel is given [10], [11], [12], [13], [14], [15]. The motivation of these studies is the realization of secure two way-relay channel with untrusted relay.…”

mentioning

confidence: 99%

Secure physical layer network coding versus secure network coding

Hayashi

2018

2018 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

Secure network coding realizes the secrecy of the message when the message is transmitted via noiseless network and a part of edges or a part of intermediate nodes are eavesdropped. In this framework, if the channels of the network has noise, we apply the error correction to noisy channel before applying the secure network coding. In contrast, secure physical layer network coding is a method to securely transmit a message by a combination of coding operation on nodes when the network is given as a set of noisy channels. In this paper, we give several examples of network, in which, secure physical layer network coding has advantage over secure network coding.only secure computation-and-forward, which is a method to securely transmit the modulo sum of two input message when noisy multiple access channel is given [10], [11], [12], [13], [14], [15]. The motivation of these studies is the realization of secure two way-relay channel with untrusted relay. To seek the further possibility of secure physical layer network coding, we need to find more examples of concrete coding schemes of secure physical layer network coding.In fact, secure network code mainly focuses on the secrecy for the attack to channels. Some typical secure network codes cannot realize the secrecy when one of intermediate nodes is eavesdropped. In contrast, secure physical layer network coding is advantageous for attacks on intermediate nodes. In this paper, we give two examples of network, in which, secure physical layer network coding realizes a performance that cannot be realized by secure network coding. One is butterfly network [16] and the other is a network with three source nodes.The remaining parts of this paper are organized as follows. Section II reviews the results of secure computation-andforward, which is a typical example of secure physical layer network coding. Section III discusses secure communication over butterfly network by using secure physical layer network coding. Section IV addresses secure communication over a network with three source nodes by using secure physical layer network coding. II. SECURE COMPUTATION-AND-FORWARDFirst, we review secure computation-and-forward. We consider secure computation-and-forward in a typical setting. Consider two senders V 1 , V 2 and one receiver R. Assume that

show abstract

End-to-End Secure Multi-Hop Communication with Untrusted Relays

Cited by 53 publications

References 21 publications

Wireless Physical-Layer Security: Lessons Learned From Information Theory

Wireless Physical-Layer Security: Lessons Learned From Information Theory

Weak Secrecy in the Multiway Untrusted Relay Channel With Compute-and-Forward

Secure physical layer network coding versus secure network coding

Contact Info

Product

Resources

About