| CARVIEW |
Select Language
HTTP/2 200
cache-control: max-age=3600
last-modified: Tue, 05 Dec 2023 01:57:31 GMT
x-frame-options: SAMEORIGIN
content-security-policy: frame-ancestors 'none'
server: Google Frontend
via: 1.1 google, 1.1 varnish, 1.1 varnish, 1.1 varnish
x-cloud-trace-context: e8779c77005ae265184225943c3118f0
content-type: text/html; charset=utf-8
accept-ranges: bytes
age: 81891
date: Thu, 01 Jan 2026 00:59:44 GMT
x-served-by: cache-lga21990-LGA, cache-lga21957-LGA, cache-bom-vanm7210089-BOM
x-cache: MISS, HIT, MISS
x-timer: S1767229184.129158,VS0,VE213
content-length: 46746
[2210.07876] Control, Confidentiality, and the Right to be Forgotten
Skip to main content
[v1] Fri, 14 Oct 2022 14:54:52 UTC (551 KB)
[v2] Mon, 4 Dec 2023 16:13:48 UTC (1,368 KB)
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors.
Donate
Computer Science > Cryptography and Security
arXiv:2210.07876 (cs)
[Submitted on 14 Oct 2022 (v1), last revised 4 Dec 2023 (this version, v2)]
Title:Control, Confidentiality, and the Right to be Forgotten
View a PDF of the paper titled Control, Confidentiality, and the Right to be Forgotten, by Aloni Cohen and 3 other authors
View PDF
Abstract:Recent digital rights frameworks give users the right to delete their data from systems that store and process their personal information (e.g., the "right to be forgotten" in the GDPR). How should deletion be formalized in complex systems that interact with many users and store derivative information? We argue that prior approaches fall short. Definitions of machine unlearning Cao and Yang [2015] are too narrowly scoped and do not apply to general interactive settings. The natural approach of deletion-as-confidentiality Garg et al. [2020] is too restrictive: by requiring secrecy of deleted data, it rules out social functionalities. We propose a new formalism: deletion-as-control. It allows users' data to be freely used before deletion, while also imposing a meaningful requirement after deletion--thereby giving users more control. Deletion-as-control provides new ways of achieving deletion in diverse settings. We apply it to social functionalities, and give a new unified view of various machine unlearning definitions from the literature. This is done by way of a new adaptive generalization of history independence. Deletion-as-control also provides a new approach to the goal of machine unlearning, that is, to maintaining a model while honoring users' deletion requests. We show that publishing a sequence of updated models that are differentially private under continual release satisfies deletion-as-control. The accuracy of such an algorithm does not depend on the number of deleted points, in contrast to the machine unlearning literature.
| Subjects: | Cryptography and Security (cs.CR); Computers and Society (cs.CY) |
| Cite as: | arXiv:2210.07876 [cs.CR] |
| (or arXiv:2210.07876v2 [cs.CR] for this version) | |
| https://doi.org/10.48550/arXiv.2210.07876
arXiv-issued DOI via DataCite
|
Submission history
From: Marika Swanberg [view email][v1] Fri, 14 Oct 2022 14:54:52 UTC (551 KB)
[v2] Mon, 4 Dec 2023 16:13:48 UTC (1,368 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
View a PDF of the paper titled Control, Confidentiality, and the Right to be Forgotten, by Aloni Cohen and 3 other authors
References & Citations
export BibTeX citation
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.