A fully decentralized auditing approach for edge computing: A Game-Theoretic Perspective
Zahra Seyedi, Farhad Rahmati, Mohammad Ali, and Ximeng Liu

TL;DR
This paper introduces a decentralized, game-theoretic auditing scheme for edge computing that replaces centralized auditors with mutual edge server audits, enhancing security, speed, and cost-effectiveness.
Contribution
It presents a novel decentralized integrity auditing method using edge servers as mutual auditors, eliminating reliance on third-party auditors and employing game theory to ensure truthful auditing.
Findings
Secure within the random oracle model
Improved speed over existing methods
Cost-effective and resistant to collusion
Abstract
Edge storage presents a viable data storage alternative for application vendors (AV), offering benefits such as reduced bandwidth overhead and latency compared to cloud storage. However, data cached in edge computing systems is susceptible to intentional or accidental disturbances. This paper proposes a decentralized integrity auditing scheme to safeguard data integrity and counter the traditional reliance on centralized third-party auditors (TPA), which are unfit for distributed systems. Our novel approach employs edge servers (ES) as mutual auditors, eliminating the need for a centralized entity. This decentralization minimizes potential collusion with malicious auditors and biases in audit outcomes. Using a strategic game model, we demonstrate that ESs are more motivated to audit each other than TPAs. The auditing process is addressed as a Nash Equilibrium problem, assuring accurate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Cryptography and Data Security · Privacy-Preserving Technologies in Data
