The work derives an approximate local secrecy capacity and defines secret local contraction coefficients as largest generalized eigenvalues of channel matrix pencils, obtained via local Euclidean geometry approximations to the wiretap channel optimization problem.
Optimal privacy-utility trade-off under a rate constraint,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Local Information-Theoretic Security via Euclidean Geometry
The work derives an approximate local secrecy capacity and defines secret local contraction coefficients as largest generalized eigenvalues of channel matrix pencils, obtained via local Euclidean geometry approximations to the wiretap channel optimization problem.