.png){kind=icon}
.png){kind=icon}
Return
Approximated Coded Computing: Towards Fast, Private and Secure Distributed Machine Learning
.png){kind=icon}
PRE
AI
DOI：10.1109/TETC.2025.3562192.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a large-scale distributed machine learning system, coded computing has attracted wide-spread attention since it can effectively alleviate the impact of stragglers. However, several emerging problems greatly limit the performance of coded distributed systems. First, an existence of colluding workers who collude results with each other leads to serious privacy leakage issues. Second, there are few existing works considering security issues in data transmission of distributed computing systems/or coded distributed machine learning systems. Third, the number of required results for which need to wait increases with the degree of decoding functions. In this article, we design a secure and private approximated coded distributed computing (SPACDC) scheme that deals with the above-mentioned problems simultaneously. Our SPACDC scheme guarantees data security during the transmission process using a new encryption algorithm based on elliptic curve cryptography. Especially, the SPACDC scheme does not impose strict constraints on the minimum number of results required to be waited for. An extensive performance analysis is conducted to demonstrate the effectiveness of our SPACDC scheme. Furthermore, we present a secure and private distributed learning algorithm based on the SPACDC scheme, which can provide information-theoretic privacy protection for training data. Our experiments show that the SPACDC-based deep learning algorithm achieves a significant speedup over the baseline approaches.
Keywords:
Coded computing
distributed machine learning
elliptic curve cryptography
security
privacy
recovery threshold
stragglers
Journal
IF:
5.4
Papers:
1.1K
Citations:
3.4K
View more organizations