Secrecy in Cooperative Relay Broadcast Channels

Ersen Ekrem, Şennur Ulukuş

IEEE Transactions on Information Theory · 2010 · 161 citations · 35 references

Concepts

TL;DR

The study examines how user cooperation enhances secrecy in cooperative relay broadcast channels and proposes a scheme that merges Marton's coding with compress‑and‑forward. The authors develop an achievable scheme using Marton's coding and compress‑and‑forward, and derive outer bounds on the rate‑equivocation region via auxiliary random variables. The results demonstrate that cooperation enlarges the secrecy region, enabling positive secrecy rates for both users in a Gaussian channel—an outcome unattainable without cooperation.

Abstract

We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that combines Marton's coding scheme for broadcast channels and Cover and El Gamal's compress-and-forward scheme for relay channels. We derive outer bounds for the rate-equivocation region using auxiliary random variables for single-letterization. Finally, we consider a Gaussian channel and show that both users can have positive secrecy rates, which is not possible for scalar Gaussian broadcast channels without cooperation.

References

35