| 1. |
- Xhemrishi, Marvin, et al.
(författare)
-
Computational Code-Based Privacy in Coded Federated Learning
- 2022
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. - 2157-8095. ; 2022-June, s. 2034-2039
-
Konferensbidrag (refereegranskat)abstract
- We propose a privacy-preserving federated learning (FL) scheme that is resilient against straggling devices. An adaptive scenario is suggested where the slower devices share their data with the faster ones and do not participate in the learning process. The proposed scheme employs code-based cryptography to ensure computational privacy of the private data, i.e., no device with bounded computational power can obtain information about the other devices' data in feasible time. For a scenario with 25 devices, the proposed scheme achieves a speed-up of 4.7 and 4 for 92 and 128 bits security, respectively, for an accuracy of 95% on the MNIST dataset compared with conventional mini-batch FL.
|
|
| 2. |
- Xhemrishi, Marvin, et al.
(författare)
-
List Decoding of Short Codes for Communication over Unknown Fading Channels
- 2019
-
Ingår i: Conference Record - Asilomar Conference on Signals, Systems and Computers. - 1058-6393. - 9781728143002 ; 2019-November, s. 810-814
-
Konferensbidrag (refereegranskat)abstract
- In this paper, the advantages of list decoding for short packet transmission over fading channels with an unknown state are illustrated. The principle is applied to polar codes (under successive cancellation list decoding) and to general short binary linear block codes (under ordered-statistics decoding). The proposed decoders assume neither a-priori knowledge of the channel coefficients, nor of their statistics. The scheme relies on short pilot fields that are used only to derive an initial channel estimate. The channel estimate is required to be accurate enough to enable a good list construction, i.e., the construction of a list that contains, with high probability, the transmitted codeword. The final decision on the message is obtained by applying a list. This allows one to use very few pilots, thus reducing the the Rayleigh block-fading channel and compared to finite-length performance bounds. The proposed technique provides (in the short block length regime) gains of 1 dB with respect to a traditional pilot-aided transmission scheme.
|
|
