Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Student works
  4. HyperAggregate: A sublinear secure aggregation protocol
 
semester or other student projects

HyperAggregate: A sublinear secure aggregation protocol

Vujasinovic, Milos
2021

In this report, we address the issue of scalability of the existing secure aggregation protocols used in decentralized machine learning to a very high number of nodes. As a solution, we propose a novel decentralized aggregation protocol that can be parameterized so that the overall computation overhead scales logarithmically with the number of nodes. The parameterization also affects input privacy of the protocol, ranging from no input privacy to the privacy against a collusion of up to all but 2 nodes. However, stronger privacy guarantees come at the cost of the computation overhead. The protocol in its current version doesn't support users dropping out. We also discuss our implementation of this protocol and measure how well it performs.

  • Files
  • Details
  • Metrics
Type
semester or other student projects
Author(s)
Vujasinovic, Milos
Advisors
He, Lie  
•
Jaggi, Martin  
Date Issued

2021

Subjects

Machine learning

•

Secure aggregation

•

Decentralized collaborative learning

•

Additive secret sharing

EPFL units
MLO  
RelationURL/DOI

IsSupplementedBy

http://yann.lecun.com/exdb/mnist/
Available on Infoscience
June 29, 2021
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/179567
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés