Decode-and-Compare: An Efficient Verification Scheme for Coded Edge Computing

Abstract

Edge computing is a promising technology that can fulfill the requirements of latency-critical and computation-intensive applications. To further enhance the performance, coded edge computing has emerged because it can optimally utilize edge devices to speed up the computation. In this paper, we tackle a major security issue in coded edge computing: how to verify the correctness of results and identify attackers. Specifically, we propose an efficient verification scheme, namely Decode-and-Compare (DC), by leveraging both the coding redundancy of edge devices and the properties of linear coding itself. To design the DC scheme, we conduct a solid theoretical analysis to show the required coding redundancy, the expected number of decoding operations, and the tradeoff between them. To evaluate the performance of DC, we conduct extensive simulation experiments and the results confirm that the DC scheme can outperform existing solutions, such as homomorphic encryption and computing locally at the user device.