Verifiable Unlearning on Edge
Mohammad M Maheri, Alex Davidson, Hamed Haddadi

TL;DR
This paper presents a zero-knowledge proof-based framework for verifiable data unlearning on edge devices, ensuring privacy, correctness, and minimal impact on personalized model performance.
Contribution
It introduces a novel verification framework using zk-SNARKs for efficient, privacy-preserving unlearning on resource-constrained edge devices, maintaining personalization quality.
Findings
Verifiable unlearning is feasible with minimal performance degradation.
The framework ensures privacy-preserving verification of unlearning operations.
Edge-compatible algorithms enable efficient zk-SNARK proof generation.
Abstract
Machine learning providers commonly distribute global models to edge devices, which subsequently personalize these models using local data. However, issues such as copyright infringements, biases, or regulatory requirements may require the verifiable removal of certain data samples across all edge devices. Ensuring that edge devices correctly execute such unlearning operations is critical to maintaining integrity. In this work, we introduce a verification framework leveraging zero-knowledge proofs, specifically zk-SNARKs, to confirm data unlearning on personalized edge-device models without compromising privacy. We have developed algorithms explicitly designed to facilitate unlearning operations that are compatible with efficient zk-SNARK proof generation, ensuring minimal computational and memory overhead suitable for constrained edge environments. Furthermore, our approach carefully…
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
TopicsIntelligent Tutoring Systems and Adaptive Learning
