Oct 2026· IEEE Transactions on Mobile Computing· Vol 25, pp. 18342-18356· 0 citations· 54 references
Abstract
Edge computing gained popularity for its promises of low latency and high-quality computing services to users. However, it has also introduced the challenge of mutual untrust between user and edge devices for service level agreement (SLA) compliance. This obstacle hampers wide adoption of edge computing, especially in pervasive edge computing (PEC) where edge devices can freely enter or exit the market, which makes verifying and enforcing SLAs significantly more challenging. In this paper, we propose a framework for verifying and enforcing SLAs in PEC, allowing a user to assess SLA compliance of an edge service and ensure correctness of the service results. Our solution, called VeriEdge, employs a verifiable delayed sampling approach to sample a small number of computation steps, and relies on randomly selected verifiers to verify correctness of the computation results. To make sure the verification process is non-manipulable, we employ verifiable random functions to post-select the verifier(s). A dispute protocol is designed to resolve disputes for potential misbehavior. Building upon the base VeriEdge framework, we further extend it with an anonymity-enhanced design to support privacy-sensitive applications, using blind signature-based tokens to enable anonymous access to edge services. Rigorous security analysis demonstrates that VeriEdge achieves a high probability of detecting SLA violation with a minimal overhead. Experimental results indicate that VeriEdge is lightweight, practical, and efficient.
SLED is developed, a secure edge--cloud framework over NDN that incorporates a Security Verification Engine (SVE) into the edge compute budget, explicitly coupling verification occupancy with named-function execution and demonstrates that verification should be treated as a first-class resource cost and jointly optimis...
Mehbub Alam· Journal of Reliable and Secu...· 1 citation
LIAM-DIoT is proposed, an edge-computing method for lightweight identity verification and automated risk-aware access control that provides a practical trust boundary for camera and light detection and ranging (LiDAR) event streams, fiber-connected gateways, and closed-loop distribution automation.
Xiao-He Yue, Sen Gao, Guang-Yue Liu· International Conference on...· 0 citations
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
Experimental results demonstrate that the proposed PUF-based authentication framework achieves high resistance to common attacks, such as eavesdropping, replay, and machine learning-based attacks while adhering to the low-latency requirements of edge networks.
Seema G. Aarella, Saraju P. Mohanty, E. Kougianos et al.· SN Computer Science· 0 citations
An Adaptive ZKP Selection Framework (AZSF) is proposed for privacy-preserving decentralized identity using DIDs and Verifiable Credentials and dynamically selects an appropriate proof mechanism according to the privacy sensitivity of requested attributes, disclosure requirements, verifier trust conditions, computationa...
Sanchita Shukla· International Journal of Cre...· 0 citations
Related blog posts
Microsoft Research Blog· microsoft.comOct 21, 2026
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…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026