Reliability and Latency Analysis for Wireless Communication Systems with a Secret-Key Budget
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917591021256704 |
|---|---|
| author | Besser, Karl-Ludwig Schaefer, Rafael F. Poor, H. Vincent |
| author_facet | Besser, Karl-Ludwig Schaefer, Rafael F. Poor, H. Vincent |
| contents | We consider a wireless communication system with a passive eavesdropper, in which a transmitter and legitimate receiver generate and use key bits to secure the transmission of their data. These bits are added to and used from a pool of available key bits. In this work, we analyze the reliability of the system in terms of the probability that the budget of available key bits will be exhausted. In addition, we investigate the latency before a transmission can take place. Since security, reliability, and latency are three important metrics for modern communication systems, it is of great interest to jointly analyze them in relation to the system parameters. In particular, we show under what conditions the system may remain in an active state indefinitely, i.e., never run out of available secret-key bits. The results presented in this work will allow system designers to adjust the system parameters in such a way that the requirements of the application in terms of both reliability and latency are met. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_02538 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Reliability and Latency Analysis for Wireless Communication Systems with a Secret-Key Budget Besser, Karl-Ludwig Schaefer, Rafael F. Poor, H. Vincent Information Theory We consider a wireless communication system with a passive eavesdropper, in which a transmitter and legitimate receiver generate and use key bits to secure the transmission of their data. These bits are added to and used from a pool of available key bits. In this work, we analyze the reliability of the system in terms of the probability that the budget of available key bits will be exhausted. In addition, we investigate the latency before a transmission can take place. Since security, reliability, and latency are three important metrics for modern communication systems, it is of great interest to jointly analyze them in relation to the system parameters. In particular, we show under what conditions the system may remain in an active state indefinitely, i.e., never run out of available secret-key bits. The results presented in this work will allow system designers to adjust the system parameters in such a way that the requirements of the application in terms of both reliability and latency are met. |
| title | Reliability and Latency Analysis for Wireless Communication Systems with a Secret-Key Budget |
| topic | Information Theory |
| url | https://arxiv.org/abs/2304.02538 |