Towards Secure Over-The-Air Computation
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929278345543680 |
|---|---|
| author | Frey, Matthias Bjelaković, Igor Stańczak, Sławomir |
| author_facet | Frey, Matthias Bjelaković, Igor Stańczak, Sławomir |
| contents | We propose a new method to protect Over-The-Air (OTA) computation schemes against passive eavesdropping. Our method uses a friendly jammer whose signal is -- contrary to common intuition -- stronger at the legitimate receiver than it is at the eavesdropper. We focus on the computation of arithmetic averages over an OTA channel. The derived secrecy guarantee translates to a lower bound on the eavesdropper's mean square error while the question of how to provide operationally more significant guarantees such as semantic security remains open for future work. The key ingredients in proving the security guarantees are a known result on channel resolvability and a generalization of existing achievability results on coding for compound channels. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2001_03174 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Towards Secure Over-The-Air Computation Frey, Matthias Bjelaković, Igor Stańczak, Sławomir Information Theory We propose a new method to protect Over-The-Air (OTA) computation schemes against passive eavesdropping. Our method uses a friendly jammer whose signal is -- contrary to common intuition -- stronger at the legitimate receiver than it is at the eavesdropper. We focus on the computation of arithmetic averages over an OTA channel. The derived secrecy guarantee translates to a lower bound on the eavesdropper's mean square error while the question of how to provide operationally more significant guarantees such as semantic security remains open for future work. The key ingredients in proving the security guarantees are a known result on channel resolvability and a generalization of existing achievability results on coding for compound channels. |
| title | Towards Secure Over-The-Air Computation |
| topic | Information Theory |
| url | https://arxiv.org/abs/2001.03174 |