Skip to content

Decoupled Edge Data Integrity Verification via Federated Adaptation and Cryptographic Validation

Sep 2026 · IEEE Internet of Things Journal · Vol 13, pp. 39702-39718 · 0 citations · 41 references
Computer Science

Abstract

Mobile edge computing (MEC) accelerates Internet of Things (IoT) applications by caching content near end users. However, cached data remains vulnerable to corruption, misleading applications, and eroding user trust. Traditional centralized edge data integrity verification (EDIV) methods adopt challenge-response protocols involving third-party auditors (TPAs), incurring nontrivial computation and communication costs along with privacy concerns. Recent decentralized frameworks leverage federated learning (FL) to train models for initial screening, eliminating TPAs. However, their performance is impeded by computational and data heterogeneity across edge nodes and the substantial overhead of blockchain-based validation. Furthermore, such frameworks exhibit limited precision in localizing corrupted data. To address these challenges, this article introduces the decoupled EDIV (D-EDIV) framework, which explicitly decouples integrity verification into a two-stage mechanism of corruption detection and corruption localization. During Stage 1, D-EDIV executes corruption detection models at edge nodes. A federated adaptation scheme tailors these models to each node’s computational resources and local data distribution. Upon detecting anomalous instances, a fusion strategy correlates network-layer alerts with cached data modification events to generate perblock suspicion scores, prompting the application vendor (AV) to trigger Stage 2. In this stage, the AV conducts targeted localization on potentially corrupted data. In particular, after authenticating data commitments via a digital signature, the AV utilizes suspicion scores to calculate dynamic decision thresholds, guiding Merkle tree traversal and restricting cryptographic validation to high-risk data blocks. Experimental results demonstrate that D-EDIV improves detection accuracy by 3%–12% and reduces computational overhead by $3\times $ – $8\times $ , efficiently achieving fine-grained integrity verification in heterogeneous MEC environments.

View source

Similar papers

Open access Aug 2026

Privacy-Preserving and Quantum-Resilient Blockchain Infrastructures for MuReQua Federated Micro Data Centers

This paper introduces Data Communities as a novel paradigm for privacy-preserving, blockchain-enabled cooperative digital infrastructures, formalized within the Cooperative Digital Infrastructure (CDI) framework and formalizes privacy guarantees through an adversarial model encompassing classical, quantum, insider, and...

Gerardo Iovane · 0 citations
Preprint Sep 2026

Transparent Identity Verification Approach Using MPC and Efficient Credential Status Handling

This work proposes a transparent and cost-effective identity verification framework based on Multi-Party Computation (MPC), which enables private off-chain code execution and produces runtime proofs anchored to a blockchain and integrates SHA3 hashing and Falcon post-quantum signatures.

Istiaque Ahmed, Shoji Kasahara, Kentaroh Toyoda et al. · 0 citations
Sep 2026

Blockchain-based data storage and data sharing contract in vehicle edge computing using adaptive deep deterministic policy gradient

In the efficient growth of Vehicular Ad Hoc Networks (VANETs), the performance of data transmission and protection is crucial for improving smooth communication. Yet, it is insufficient for accurately handling a huge amount of user data to address the aforementioned issues in the training phase, and it reduces the secu...

Lavanya Kalidoss, Jafar A. Alzubi, Rajesh Arunachalam et al. · 0 citations
Review Open access Aug 2026

CROSS-LAYER LATENCY IN BLOCKCHAIN-ENABLED HIOT: A COMPREHENSIVE SURVEY

This study reviews latency-reduction approaches across the data filtering and encryption layers using a micro–macro perspective, and proposes a dependency-aware model that links local processing with propagation, queueing, consensus and storage.

S. Chakraborty, Souritra Mandal, Subham Ghosh et al. · 0 citations
Conference Aug 2026

ARP Spoofing Prevention in SDN using Host Agents and Cryptographically Verified IP-MAC Bindings

The inherently trustless nature of the Address Resolution Protocol (ARP) enables attackers to intercept network traffic using forged messages. While traditional reactive defences, like machine learning, attempt to mitigate this, they often suffer from deployment complexity, poor scalability, and high latency. To overco...

Sankalpa Fernando, Shriparen Sriskandarajah · 0 citations
2026

Trust-Centric Federated Learning Using Blockchain-Enabled Smart Contracts: An Analysis of Data Privacy, Model Integrity, and Decentralized AI Governance

A trust-based federated learning framework in which a smart contract enabled by blockchain oversees client registration, model update logging, hash-based integrity verification, trust score calculation, malicious node penalization, aggregation approval, and decentralised audit logging is proposed.

Shankar Thalla · 0 citations

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.