
Research Article
Secure and Private Coding for Edge Computing Against Cooperative Attack with Low Communication Cost and Computational Load
@INPROCEEDINGS{10.1007/978-3-031-24383-7_12, author={Xiaotian Zou and Jin Wang and Can Liu and Lingzhi Li and Fei Gu and Guojing Li}, title={Secure and Private Coding for Edge Computing Against Cooperative Attack with Low Communication Cost and Computational Load}, proceedings={Collaborative Computing: Networking, Applications and Worksharing. 18th EAI International Conference, CollaborateCom 2022, Hangzhou, China, October 15-16, 2022, Proceedings, Part I}, proceedings_a={COLLABORATECOM}, year={2023}, month={1}, keywords={Edge computing Security Privacy Communication cost Computational load}, doi={10.1007/978-3-031-24383-7_12} }
- Xiaotian Zou
Jin Wang
Can Liu
Lingzhi Li
Fei Gu
Guojing Li
Year: 2023
Secure and Private Coding for Edge Computing Against Cooperative Attack with Low Communication Cost and Computational Load
COLLABORATECOM
Springer
DOI: 10.1007/978-3-031-24383-7_12
Abstract
Edge computing is an efficient computing paradigm, which can utilize computing devices at the edge of network to provide real-time proximity service. Since edge devices lack centralized management, they are more vulnerable to being attacked. Therefore, the issues of data security and user privacy in edge computing are particularly important. A large number of existing literature focus on the data security and user privacy with independent attackers. However, cooperative attacks, in which multiple attackers can collaborate to obtain the data content and user privacy, have not been fully investigated. In particular, we take the matrix-vector multiplication which is a basic component of most machine learning algorithms as the basic task. Therefore, in this paper, we focus on theSecure and Privacy Matrix-vector Multiplication(SPMM) issue for edge computing against cooperative attack and design a general coded computation scheme to achieve lowest system resource consumption,i.e.communication cost and computational load. Specifically, we propose two coding schemes:Secure and Private Coding with lower communication Cost(SPCC) andSecure and Private Coding with lower computational Load(SPCL). We also conduct solid theoretical analyses and extensive experiments to demonstrate that both two proposed coding schemes can achieve lower communication cost and computational load than existing work. Finally, we perform extensive analyses to the superiority of the proposed schemes.