DynaEDI: Decentralized Integrity Verification for Dynamic Edge Data

In an edge computing environment, data can be cached on edge servers to enable fast data services for users. These edge data are subject to corruption and must be verified to ensure their integrity. Meanwhile, they are also subject to partial content changes over time. Existing Edge Data Integrity (EDI) schemes are designed to verify edge data as a whole. They fail to accommodate partially-identical edge data, and consequently, suffer from low verification accuracy in many real-world applications. This paper presents DynaEDI, a novel decentralized scheme capable of verifying the integrity of partially-identical edge data. At its core, DynaEDI generates pairing trees, a new tree structure, as data digests. Based on these data digests, edge servers can verify the integrity of their data through subtree-based content comparison between version-matched data blocks. In addition, DynaEDI reduces communication overhead by transmitting only the root nodes instead of complete trees for verification. Experimental results show that DynaEDI increases verification accuracy by up to 35% and reduces communication overhead by an order of magnitude, compared to benchmark schemes.