Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
EFU: Enforcing Federated Unlearning via Functional Encryption
Mälardalen University, Vasteras, Västmanland, Sweden.
Technische Universiteit Eindhoven, Eindhoven, Noord-Brabant, Netherlands.
RISE Research Institutes of Sweden, Digital Systems, Industrial Systems.ORCID iD: 0000-0003-4494-6685
Mälardalen University, Vasteras, Västmanland, Sweden .
Show others and affiliations
2025 (English)In: CIKM 2025 - Proceedings of the 34th ACM International Conference on Information and Knowledge Management, Association for Computing Machinery (ACM), 2025, p. 2148-2158Conference paper, Published paper (Refereed)
Abstract [en]

Federated unlearning (FU) algorithms allow clients in federated settings to exercise their right to be forgotten by removing the influence of their data from a collaboratively trained model. Existing FU methods maintain data privacy by performing unlearning locally on the client-side and sending targeted updates to the server without exposing forgotten data; yet they often rely on server-side cooperation, revealing the client's intent and identity without enforcement guarantees - compromising autonomy and unlearning privacy. In this work, we propose EFU (Enforced Federated Unlearning), a cryptographically enforced FU framework that enables clients to initiate unlearning while concealing its occurrence from the server. Specifically, EFU leverages functional encryption to bind encrypted updates to specific aggregation functions, ensuring the server can neither perform unauthorized computations nor detect or skip unlearning requests. To further mask behavioral and parameter shifts in the aggregated model, we incorporate auxiliary unlearning losses based on adversarial examples and parameter importance regularization. Extensive experiments show that EFU achieves near-random accuracy on forgotten data while maintaining performance comparable to full retraining across datasets and neural architectures - all while concealing unlearning intent from the server. Furthermore, we demonstrate that EFU is agnostic to the underlying unlearning algorithm, enabling secure, function-hiding, and verifiable unlearning for any client-side FU mechanism that issues targeted updates. © 2025

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2025. p. 2148-2158
Keywords [en]
enforceable machine unlearning, federated unlearning, function hiding, functional encryption, model update indistinguishability, secure aggregation, unlearning verification
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:ri:diva-80034DOI: 10.1145/3746252.3761091Scopus ID: 2-s2.0-105023195540ISBN: 9798400720406 (print)OAI: oai:DiVA.org:ri-80034DiVA, id: diva2:2022111
Conference
34th ACM International Conference on Information and Knowledge Management, CIKM 2025, 10 November 2025 - 14 November 2025, Seoul
Available from: 2025-12-16 Created: 2025-12-16 Last updated: 2025-12-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Symeonidis, Iraklis

Search in DiVA

By author/editor
Symeonidis, Iraklis
By organisation
Industrial Systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf