2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) 2020
DOI: 10.1109/icdcs47774.2020.00017
|View full text |Cite
|
Sign up to set email alerts
|

Boosting Privately: Federated Extreme Gradient Boosting for Mobile Crowdsensing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 69 publications
(46 citation statements)
references
References 17 publications
0
46
0
Order By: Relevance
“…Then each party receives a single point from this function, and k of those points can be used to compute the function equation and subsequently take the y-axis intersection as the secret. Secret sharing has been used for FL by Bonawitz et al [6] and Liu et al [46] to securely compute aggregate parameter values. In contrast, Zhang et al [76] adopt this method to distribute a private encryption key to multiple clients.…”
Section: (Additively) Homomorphicmentioning
confidence: 99%
“…Then each party receives a single point from this function, and k of those points can be used to compute the function equation and subsequently take the y-axis intersection as the secret. Secret sharing has been used for FL by Bonawitz et al [6] and Liu et al [46] to securely compute aggregate parameter values. In contrast, Zhang et al [76] adopt this method to distribute a private encryption key to multiple clients.…”
Section: (Additively) Homomorphicmentioning
confidence: 99%
“…For example, Aono et al [23] used homomorphic encryption to improve the logistic regression algorithm ensuring the security of the training and predicting data. Liu et al [24] propose a secret sharing-based federated extreme boosting learning framework to achieve privacypreserving model training for mobile crowdsensing. Xu et al [25] proposed a privacy-preserving and verifiable federated learning framework based on homomorphic hash functions, in which clients can verify whether the result returned by cloud server is correct.…”
Section: Related Workmentioning
confidence: 99%
“…Kikuchi et al combine SMC [41] and HE [167] approaches, and they design a secure scalar product protocol that incurs low communication costs and does not require a trusted setup [96]. For XGBoost, several works use HE and secret sharing to protect the local intermediate residuals [118,119,175]. Liu et al [118] propose an aggregation scheme that, with Shamir secret sharing and Paillier HE, ensures that the aggregator cannot access individual party updates.…”
Section: Secure Multiparty Computation Du and Zhanmentioning
confidence: 99%
“…For XGBoost, several works use HE and secret sharing to protect the local intermediate residuals [118,119,175]. Liu et al [118] propose an aggregation scheme that, with Shamir secret sharing and Paillier HE, ensures that the aggregator cannot access individual party updates. Each party locally computes gradients and the aggregator derives the score of each party's split to select in clear the best one.…”
Section: Secure Multiparty Computation Du and Zhanmentioning
confidence: 99%
See 1 more Smart Citation