Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1104.3556

How to Achieve Privacy in Bidirectional Relay Networks

Rafael F. Wyrembelski, Holger Boche

Published Apr 18, 2011• 0 citations
arXivHTMLPDF

Abstract

Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept as secret as possible from the other, non-intended node. This is the bidirectional broadcast channel with confidential messages for which we derive the capacityequivocation region and the secrecy capacity region. The latter characterizes the communication scenario with perfect secrecy, where the confidential message is completely hidden from the non-legitimated node.

DOI
10.48550/arxiv.1104.3556

Related papers

How to achieve privacy in bidirectional relay networks

Rafael F. Wyrembelski, Holger Boche

Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept as secret as possible from the other, non-intended node. This is the bidirectional broadcast channel with confidential messages for which we derive the capacity-equivocation region and the secrecy capacity region. The latter characterizes the communication scenario with perfect secrecy, where the confidential message is completely hidden from the non-legitimated node.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2011•4 citations

Secrecy in MIMO Gaussian bidirectional broadcast channels

Rafael F. Wyrembelski, Holger Boche

Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we assume multiple transmit and receive antennas and consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept completely secret from the other, non-intended node. This is the MIMO Gaussian bidirectional broadcast channel with confidential messages for which we establish the secrecy capacity region.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jun 1, 2011•2 citations

Privacy in Bidirectional Relay Networks

Rafael F. Wyrembelski, Holger Boche

In this work, the bidirectional broadcast channel (BBC) with confidential messages is studied. The problem is motivated by the concept of bidirectional relaying in a three-node network, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol and thereby transmits additional confidential information to one of them in the broadcast phase. The corresponding confidential message is transmitted at a certain secrecy level which characterizes the amount of information that can be kept secret from the non-legitimate node. The capacity-equivocation and secrecy capacity regions of the BBC with confidential messages are established where the latter characterizes the communication scenario with perfect secrecy, which means that the confidential information is completely hidden from the non-legitimate node. Thereby, it is shown that the optimal processing exploits ideas and concepts of the BBC with common messages and of the classical broadcast channel with confidential messages.

IEEE Transactions on Communications•Jun 1, 2012•5 citations

Strong secrecy in bidirectional relay networks

Rafael F. Wyrembelski, Moritz Wiese, Holger Boche

To increase the spectral efficiency of future wireless networks, it is important to wisely integrate multiple services at the physical layer. Here we study the efficient integration of confidential services in bidirectional relay networks, where a relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In the broadcast phase the relay transmits an additional confidential message to one node while keeping the other node completely ignorant of it. We use the concept of strong information theoretic security to ensure that the non-legitimate node cannot decode the confidential message no matter what its computational resources are. This results in the study of the bidirectional broadcast channel with confidential messages for which we establish the strong secrecy capacity region.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•4 citations

Strong Secrecy in Bidirectional Broadcast Channels With Confidential Messages

Rafael F. Wyrembelski, Moritz Wiese, Holger Boche

To increase the spectral efficiency of future wireless networks, it is important to wisely integrate multiple services at the physical layer. Here the efficient integration of confidential services in the three-node bidirectional relay channel is studied. A relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol, which is also known as two-way relaying. In the broadcast phase, the relay transmits not only the two bidirectional messages it received in the previous multiple access phase, but also an additional confidential message to one node while keeping the other node completely ignorant of it. The concept of strong information theoretic secrecy is used to ensure that the nonlegitimate node cannot decode the confidential message no matter what its computational resources are. Moreover, this implies that the average decoding error at the nonlegitimate node goes exponentially fast to one for any decoding strategy it may use. This results in the study of the bidirectional broadcast channel with confidential messages for which the strong secrecy capacity region is established. Furthermore, it is shown that the efficient integration of confidential messages with strong secrecy extends to such scenarios, where the relay further transmits an additional common message to both nodes.

IEEE Transactions on Information Forensics and Security•Dec 11, 2012•14 citations

Bidirectional broadcast channels with common and confidential messages

Rafael F. Wyrembelski, Holger Boche

In this work, we study the bidirectional broadcast channel with common and confidential messages and establish the capacity-equivocation and secrecy capacity regions. This problem is motivated by the concept of bidirectional relaying in a three-node network, where a relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol and thereby efficiently integrates additional common and confidential services.

IEEE Information Theory Workshop (ITW)•Oct 1, 2011•10 citations
Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept as secret as possible from the other, non-intended node. This is the bidirectional broadcast channel with confidential messages for which we derive the capacityequivocation region and the secrecy capacity region. The latter characterizes the communication scenario with perfect secrecy, where the confidential message is completely hidden from the non-legitimated node.
Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept as secret as possible from the other, non-intended node. This is the bidirectional broadcast channel with confidential messages for which we derive the capacity-equivocation region and the secrecy capacity region. The latter characterizes the communication scenario with perfect secrecy, where the confidential message is completely hidden from the non-legitimated node.
Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In this work we assume multiple transmit and receive antennas and consider the scenario when in the broadcast phase the relay transmits additional confidential information to one node, which should be kept completely secret from the other, non-intended node. This is the MIMO Gaussian bidirectional broadcast channel with confidential messages for which we establish the secrecy capacity region.
In this work, the bidirectional broadcast channel (BBC) with confidential messages is studied. The problem is motivated by the concept of bidirectional relaying in a three-node network, where a half-duplex relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol and thereby transmits additional confidential information to one of them in the broadcast phase. The corresponding confidential message is transmitted at a certain secrecy level which characterizes the amount of information that can be kept secret from the non-legitimate node. The capacity-equivocation and secrecy capacity regions of the BBC with confidential messages are established where the latter characterizes the communication scenario with perfect secrecy, which means that the confidential information is completely hidden from the non-legitimate node. Thereby, it is shown that the optimal processing exploits ideas and concepts of the BBC with common messages and of the classical broadcast channel with confidential messages.
To increase the spectral efficiency of future wireless networks, it is important to wisely integrate multiple services at the physical layer. Here we study the efficient integration of confidential services in bidirectional relay networks, where a relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. In the broadcast phase the relay transmits an additional confidential message to one node while keeping the other node completely ignorant of it. We use the concept of strong information theoretic security to ensure that the non-legitimate node cannot decode the confidential message no matter what its computational resources are. This results in the study of the bidirectional broadcast channel with confidential messages for which we establish the strong secrecy capacity region.
To increase the spectral efficiency of future wireless networks, it is important to wisely integrate multiple services at the physical layer. Here the efficient integration of confidential services in the three-node bidirectional relay channel is studied. A relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol, which is also known as two-way relaying. In the broadcast phase, the relay transmits not only the two bidirectional messages it received in the previous multiple access phase, but also an additional confidential message to one node while keeping the other node completely ignorant of it. The concept of strong information theoretic secrecy is used to ensure that the nonlegitimate node cannot decode the confidential message no matter what its computational resources are. Moreover, this implies that the average decoding error at the nonlegitimate node goes exponentially fast to one for any decoding strategy it may use. This results in the study of the bidirectional broadcast channel with confidential messages for which the strong secrecy capacity region is established. Furthermore, it is shown that the efficient integration of confidential messages with strong secrecy extends to such scenarios, where the relay further transmits an additional common message to both nodes.