Pith. sign in

REVIEW 1 cited by

Adding a Helper Can Totally Remove the Secrecy Constraints in Interference Channel

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.00550 v1 pith:7G5A6QTT submitted 2018-12-03 cs.IT math.IT

Adding a Helper Can Totally Remove the Secrecy Constraints in Interference Channel

classification cs.IT math.IT
keywords gdofconstraintssecrecychannelinterferencehelperpenaltysecure
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In many communication channels, secrecy constraints usually incur a penalty in capacity, as well as generalized degrees-of-freedom (GDoF). In this work we show an interesting observation that, adding a helper can totally remove the penalty in sum GDoF, for a two-user symmetric Gaussian interference channel. For the interference channel where each transmitter sends a message to an intended receiver without secrecy constraints, the sum GDoF is a well-known "W" curve, characterized by Etkin-Tse-Wang in 2008. If the secrecy constraints are imposed on this interference channel, where the message of each transmitter must be secure from the unintended receiver (eavesdropper), then a GDoF penalty is incurred and the secure sum GDoF is reduced to a modified "W" curve, derived by Chen recently. In this work we show that, by adding a helper into this interference channel with secrecy constraints, the secure sum GDoF turns out to be a "W" curve, which is the same as the sum GDoF of the setting without secrecy constraints. The proposed scheme is based on the cooperative jamming and a careful signal design such that the jamming signal of the helper is aligned at a specific direction and power level with the information signals of the transmitters, which allows to totally remove the penalty in GDoF due to the secrecy constraints. Furthermore, the estimation approaches of noise removal and signal separation due to the rational independence are used in the secure rate analysis.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks

    cs.IT 2019-07 unverdicted novelty 6.0

    Adding common randomness at transmitters removes the GDoF penalty due to secrecy constraints in three symmetric Gaussian network settings, with the minimal required randomness characterized.