English

Verifiable Unlearning on Edge

Machine Learning 2025-06-26 v1 Cryptography and Security

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 preserves personalized enhancements on edge devices, maintaining model performance post-unlearning. Our results affirm the practicality and effectiveness of this verification framework, demonstrating verifiable unlearning with minimal degradation in personalization-induced performance improvements. Our methodology ensures verifiable, privacy-preserving, and effective machine unlearning across edge devices.

Keywords

Cite

@article{arxiv.2506.20037,
  title  = {Verifiable Unlearning on Edge},
  author = {Mohammad M Maheri and Alex Davidson and Hamed Haddadi},
  journal= {arXiv preprint arXiv:2506.20037},
  year   = {2025}
}

Comments

This paper has been accepted to the IEEE European Symposium on Security and Privacy (EuroS&P) 2025

R2 v1 2026-07-01T03:32:21.992Z