TY - GEN
T1 - A Null-space-based Verification Scheme for Coded Edge Computing against Pollution Attacks
AU - Fu, Mingjia
AU - Wang, Jin
AU - Zhou, Jingya
AU - Wang, Jianping
AU - Lu, Kejie
AU - Zhou, Xiaobo
PY - 2019/12
Y1 - 2019/12
N2 - Edge computing is attracting more and more attention in recent years to fulfill the requirements of latency-critical and computation-intensive applications. By using the coding redundancy, coded edge computing has emerged to optimize the total computation latency. Compared with the servers in cloud computing, edge devices located at the edge of network may not be reliable and trustworthy. In coded edge computing, even one incorrect intermediate result will lead to the incorrect final result. Therefore, considering the low computation capabilities of edge devices and low latency requirements of user, we study the result verification problem for coded edge computing. Specifically, we propose an efficient Orthogonal Mark (OM) verification scheme by the properties of linear space. We also conduct solid theoretical analysis to show the successful verification probabilities under two kinds of attack models, respectively. Finally, we conduct extensive simulations to show the effectiveness of the proposed OM verification scheme when comparing with basic coded edge computing scheme and Decoding Comparison (DC) scheme. ©2019 IEEE.
AB - Edge computing is attracting more and more attention in recent years to fulfill the requirements of latency-critical and computation-intensive applications. By using the coding redundancy, coded edge computing has emerged to optimize the total computation latency. Compared with the servers in cloud computing, edge devices located at the edge of network may not be reliable and trustworthy. In coded edge computing, even one incorrect intermediate result will lead to the incorrect final result. Therefore, considering the low computation capabilities of edge devices and low latency requirements of user, we study the result verification problem for coded edge computing. Specifically, we propose an efficient Orthogonal Mark (OM) verification scheme by the properties of linear space. We also conduct solid theoretical analysis to show the successful verification probabilities under two kinds of attack models, respectively. Finally, we conduct extensive simulations to show the effectiveness of the proposed OM verification scheme when comparing with basic coded edge computing scheme and Decoding Comparison (DC) scheme. ©2019 IEEE.
KW - Distributed computing
KW - Edge computing
KW - Linear coding
KW - Null space
KW - Verifiable computation
UR - http://www.scopus.com/inward/record.url?scp=85078956863&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85078956863&origin=recordpage
U2 - 10.1109/ICPADS47876.2019.00071
DO - 10.1109/ICPADS47876.2019.00071
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 978-1-7281-2584-8
T3 - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
SP - 454
EP - 461
BT - 2019 IEEE 25th International Conference on Parallel and Distributed Systems, ICPADS 2019
PB - IEEE
T2 - 25th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2019
Y2 - 4 December 2019 through 6 December 2019
ER -