Paper 2022/1073

Fixing Issues and Achieving Maliciously Secure Verifiable Aggregation in ``VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning''

Xiaojie Guo, Nankai University
Abstract

This work addresses the security flaw in the original VeriFL protocol and proposes a patched protocol. The patched protocol is secure against any static malicious adversary with a certain threshold and only introduces moderate modifications to the original protocol.

Note: The original VeriFL protocol is available at: https://doi.org/10.1109/TIFS.2020.3043139. This document is supplementary material to the original paper.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Secure AggregationVerifiable AggregationFederated Learning
Contact author(s)
xiaojie guo @ mail nankai edu cn
History
2022-08-24: revised
2022-08-18: received
See all versions
Short URL
https://ia.cr/2022/1073
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/1073,
      author = {Xiaojie Guo},
      title = {Fixing Issues and Achieving Maliciously Secure Verifiable Aggregation in ``VeriFL: Communication-Efficient and Fast Verifiable Aggregation for Federated Learning''},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1073},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1073}},
      url = {https://eprint.iacr.org/2022/1073}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.