{"ID":2827261,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.18025","arxiv_id":"2512.18025","title":"Scalable Multiterminal Key Agreement via Error-Correcting Codes","abstract":"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.","short_abstract":"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 the...","url_abs":"https://arxiv.org/abs/2512.18025","url_pdf":"https://arxiv.org/pdf/2512.18025v1","authors":"[\"Benjamin D. Kim\",\"Daniel Alabi\",\"Lav R. Varshney\"]","published":"2025-12-19T19:40:29Z","proceeding":"cs.IT","tasks":"[\"cs.IT\",\"cs.CR\"]","methods":"[]","has_code":false}