On Secure Gradient Coding with Uncoded Groupwise Keys
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866913029898108928 |
|---|---|
| author | You, Xudong Wan, Kai Zhang, Xiang Huang, Wenbo Qiu, Robert Caiming Caire, Giuseppe |
| author_facet | You, Xudong Wan, Kai Zhang, Xiang Huang, Wenbo Qiu, Robert Caiming Caire, Giuseppe |
| contents | This paper considers a new secure gradient coding problem with uncoded groupwise keys, formalized as a (K, N, N_r, M, S) secure gradient coding model, where a user aims to compute the sum of the gradients from K datasets with the assistance of N distributed servers. We consider arbitrary heterogeneous data assignment, where each dataset is assigned to at least M servers. The user should recover the sum of gradients from the transmissions of any N_r servers. The security constraint guarantees that even if the user receives the transmitted messages from all servers, it cannot obtain any other information about the datasets except the sum of gradients. Compared to existing secure gradient coding works, we introduce a practical constraint on secret keys, namely uncoded groupwise keys, where the keys are mutually independent and each key is shared by precisely S servers. An achievable secure gradient coding scheme with uncoded groupwise keys is proposed, which is then proven to be optimal if S > M and to be order optimal within a factor of 2 otherwise. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_12578 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Secure Gradient Coding with Uncoded Groupwise Keys You, Xudong Wan, Kai Zhang, Xiang Huang, Wenbo Qiu, Robert Caiming Caire, Giuseppe Information Theory This paper considers a new secure gradient coding problem with uncoded groupwise keys, formalized as a (K, N, N_r, M, S) secure gradient coding model, where a user aims to compute the sum of the gradients from K datasets with the assistance of N distributed servers. We consider arbitrary heterogeneous data assignment, where each dataset is assigned to at least M servers. The user should recover the sum of gradients from the transmissions of any N_r servers. The security constraint guarantees that even if the user receives the transmitted messages from all servers, it cannot obtain any other information about the datasets except the sum of gradients. Compared to existing secure gradient coding works, we introduce a practical constraint on secret keys, namely uncoded groupwise keys, where the keys are mutually independent and each key is shared by precisely S servers. An achievable secure gradient coding scheme with uncoded groupwise keys is proposed, which is then proven to be optimal if S > M and to be order optimal within a factor of 2 otherwise. |
| title | On Secure Gradient Coding with Uncoded Groupwise Keys |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.12578 |