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.
Discrete memoryless interference and broadcast channel with confidential messages: secrecy rate regions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Adding Common Randomness Can Remove the Secrecy Constraints in Communication Networks
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.