Scalable Multiterminal Key Agreement via Error-Correcting Codes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918256707633152 |
|---|---|
| author | Kim, Benjamin D. Alabi, Daniel Varshney, Lav R. |
| author_facet | Kim, Benjamin D. Alabi, Daniel Varshney, Lav R. |
| contents | We explore connections between secret sharing and secret key agreement, which yield a simple and scalable multiterminal key agreement protocol. In our construction, we use error-correcting codes, specifically Reed-Solomon codes with threshold reconstruction, to ensure no information is leaked to an eavesdropper. We then derive novel bounds for both full-rank maximum distance separable codes and our scheme's secret key capacity, using key capacity's duality with multivariate mutual information. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_18025 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Scalable Multiterminal Key Agreement via Error-Correcting Codes Kim, Benjamin D. Alabi, Daniel Varshney, Lav R. Information Theory Cryptography and Security We explore connections between secret sharing and secret key agreement, which yield a simple and scalable multiterminal key agreement protocol. In our construction, we use error-correcting codes, specifically Reed-Solomon codes with threshold reconstruction, to ensure no information is leaked to an eavesdropper. We then derive novel bounds for both full-rank maximum distance separable codes and our scheme's secret key capacity, using key capacity's duality with multivariate mutual information. |
| title | Scalable Multiterminal Key Agreement via Error-Correcting Codes |
| topic | Information Theory Cryptography and Security |
| url | https://arxiv.org/abs/2512.18025 |