Local Approximation of Secrecy Capacity
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914721196670976 |
|---|---|
| author | Athanasakos, Emmanouil M. Kalouptsidis, Nicholas Manjunath, Hariprasad |
| author_facet | Athanasakos, Emmanouil M. Kalouptsidis, Nicholas Manjunath, Hariprasad |
| contents | This paper uses Euclidean Information Theory (EIT) to analyze the wiretap channel. We investigate a scenario of efficiently transmitting a small amount of information subject to compression rate and secrecy constraints. We transform the information-theoretic problem into a linear algebra problem and obtain the perturbed probability distributions such that secrecy is achievable. Local approximations are being used in order to obtain an estimate of the secrecy capacity by solving a generalized eigenvalue problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_13345 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Local Approximation of Secrecy Capacity Athanasakos, Emmanouil M. Kalouptsidis, Nicholas Manjunath, Hariprasad Information Theory Cryptography and Security This paper uses Euclidean Information Theory (EIT) to analyze the wiretap channel. We investigate a scenario of efficiently transmitting a small amount of information subject to compression rate and secrecy constraints. We transform the information-theoretic problem into a linear algebra problem and obtain the perturbed probability distributions such that secrecy is achievable. Local approximations are being used in order to obtain an estimate of the secrecy capacity by solving a generalized eigenvalue problem. |
| title | Local Approximation of Secrecy Capacity |
| topic | Information Theory Cryptography and Security |
| url | https://arxiv.org/abs/2403.13345 |