Name
Abstract | ||
|---|---|---|
This paper studies the one-sided secrecy of a full duplex two-way wiretap channel. It is motivated by a practical communication scenario, where two legitimate users communicate with each other in the presence of an external eavesdropper and only one of the users wishes to keep its message confidential from the external eavesdropper for the sake of privacy. As a general result, we establish an achievable rate region via cooperative jamming and random binning mechanisms. An outer bound of the one-sided secrecy rate region is also derived for the two-way wiretap channel with one-sided secrecy. Besides, numerical results are provided for binary-input deterministic channels. In particular, the one-sided secrecy capacity region for the binary XOR channel is fully characterized. In general, channel prefixing demonstrates its advantage in enlarging the achievable one-sided secrecy rate region. |
Year | Venue | Field |
|---|---|---|
2016 | PROCEEDINGS OF 2016 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA 2016) | Computer science,Upper and lower bounds,Secrecy,Communication channel,Theoretical computer science,Decoding methods,Jamming,Encoding (memory),Binary number |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chao Qi | 1 | 0 | 0.68 |
| Yanling Chen | 2 | 8 | 5.50 |
| a j han vinck | 3 | 419 | 58.77 |
| Xiaohu Tang | 4 | 1294 | 121.15 |