BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Information Systems Group
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20231201T130000
DTEND;TZID=America/Los_Angeles:20231201T140000
DTSTAMP:20260606T091754
CREATED:20231129T053803Z
LAST-MODIFIED:20260417T191706Z
UID:1653-1701435600-1701439200@isg.ics.uci.edu
SUMMARY:Vishal Chakraborty: Much Ado About Data-Undo: Semantically Meaningful Data Erasure
DESCRIPTION:Title: Much Ado About Data-Undo: Semantically Meaningful Data Erasure\n \n\nAbstract:  \n\nData regulations\, such as GDPR and CCPA\, are increasingly being adopted globally to protect against unsafe data management practices. Such regulations are\, often ambiguous (with multiple valid interpretations) when it comes to defining the expected dynamic behaviour of data processing systems. We will argue and show that it is possible to represent regulations such as GDPR formally as invariants using a (small set of) data processing concepts that capture system behaviour. When such concepts are grounded\, i.e.\, they are provided with a single unambiguous interpretation\, systems can achieve compliance by demonstrating that the system actions they implement maintain the invariants (representing the regulations). To illustrate our vision\, we propose Data-CASE\, a simple yet powerful model that (a) captures key data processing concepts and (b) a set of invariants that describe regulations in terms of these concepts. \nNext\, we use Data-CASE to study different interpretations of data erasure\, a key component of almost all data regulations that exist today. We present a taxonomy of data erasure from the perspective of databases. Recent work has shown that in social media platforms and other applications where extensive data dependencies are present\, data erasure is often implemented incorrectly/incompletely. Motivated by this\, we formulate data erasure as a mechanism for preventing data leakage in databases by accounting for data dependencies such as logs\, AI/ML models\, materialized views\, etc. We propose a SQL-like language to express such data dependencies which are an input to the data erasure mechanism. We show that the decision variant of our problem is NP-complete and present some algorithms to optimize overheads such as the cost of data\, time taken\, and additional number of erasures. We evaluate our implementations in PostgreSQL by analyzing the overheads (time\, space\, additional erasures and computation) of offering semantically meaningful data erasure. \n\n\n\nBio: Vishal Chakraborty is a Ph.D. student advised by Professor Sharad Mehrotra. He works on data management with a focus on privacy and efficient policy management. For more info\, visit https://www.vishalc.com.
URL:https://isg.ics.uci.edu/event/vishal-chakraborty-much-ado-about-data-undo-semantically-meaningful-data-erasure/
LOCATION:DBH 4011
END:VEVENT
END:VCALENDAR