Consent management in data workflows: a graph problem
Consent management in data workflows: a graph problem
In modern data processing systems users expect a service provider to automatically respect their consent in all data processing within the service. However, data may be processed for many different purposes by several layers of algorithms that create complex workflows. To date, there is no existing approach to automatically satisfy fine-grained privacy constraints of a user in a way which optimises the service provider's gains from processing. In this paper, we model a data processing workflow as a graph. User constraints and processing purposes are pairs of vertices which need to be disconnected in this graph. We propose heuristics and algorithms while at the same time we show that, in general, this problem is NP-hard. We discuss the optimality versus efficiency of our algorithms and evaluate them using synthetically generated data. On the practical side, our algorithms can provide a nearly optimal solution in the face of tens of constraints and graphs of thousands of nodes, in a few seconds.
737-748
Filipczuk, Dorota
582b73c6-5445-4679-88b5-15d8e1234679
Gerding, Enrico H.
d9e92ee5-1a8c-4467-a689-8363e7743362
Konstantinidis, George
f174fb99-8434-4485-a7e4-bee0fef39b42
March 2023
Filipczuk, Dorota
582b73c6-5445-4679-88b5-15d8e1234679
Gerding, Enrico H.
d9e92ee5-1a8c-4467-a689-8363e7743362
Konstantinidis, George
f174fb99-8434-4485-a7e4-bee0fef39b42
Filipczuk, Dorota, Gerding, Enrico H. and Konstantinidis, George
(2023)
Consent management in data workflows: a graph problem.
In Proceedings of the 26th International Conference on Extending Database Technology (EDBT).
vol. 26,
.
(doi:10.48786/edbt.2023.61).
Record type:
Conference or Workshop Item
(Paper)
Abstract
In modern data processing systems users expect a service provider to automatically respect their consent in all data processing within the service. However, data may be processed for many different purposes by several layers of algorithms that create complex workflows. To date, there is no existing approach to automatically satisfy fine-grained privacy constraints of a user in a way which optimises the service provider's gains from processing. In this paper, we model a data processing workflow as a graph. User constraints and processing purposes are pairs of vertices which need to be disconnected in this graph. We propose heuristics and algorithms while at the same time we show that, in general, this problem is NP-hard. We discuss the optimality versus efficiency of our algorithms and evaluate them using synthetically generated data. On the practical side, our algorithms can provide a nearly optimal solution in the face of tens of constraints and graphs of thousands of nodes, in a few seconds.
Text
3-paper-121
- Version of Record
More information
Published date: March 2023
Additional Information:
Funding Information:
E. Gerding was partially funded by the EPSRC-funded platform grant “AutoTrust: Designing a Human-Centred Trusted, Secure, Intelligent and Usable Internet of Vehicles” (EP/R029563/1). G. Konstantinidis was partially funded by the UKRI Horizon Europe guarantee funding scheme for the Horizon Europe projects RAISE (101058479) and UPCAST (101093216).
Venue - Dates:
26th International Conference on Extending Database Technology, EDBT 2023, , Ioannina, Greece, 2023-03-28 - 2023-03-31
Identifiers
Local EPrints ID: 480617
URI: http://eprints.soton.ac.uk/id/eprint/480617
PURE UUID: 5761f0a3-3a80-423d-a27c-a6a82930fd91
Catalogue record
Date deposited: 08 Aug 2023 16:30
Last modified: 18 Mar 2024 03:02
Export record
Altmetrics
Contributors
Author:
Dorota Filipczuk
Author:
Enrico H. Gerding
Author:
George Konstantinidis
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics