PrivTru: A Privacy-by-Design Data Trustee Minimizing Information Leakage

• URL: http://arxiv.org/abs/2506.06124v1
• Date: Fri, 06 Jun 2025 14:33:59 GMT
• Title: PrivTru: A Privacy-by-Design Data Trustee Minimizing Information Leakage
• Authors: Lukas Gehring, Florian Tschorsch,
• Abstract summary: We introduce PrivTru, an instantiation of a data trustee that achieves optimal privacy properties.<n>PrivTru calculates the minimal amount of information the data trustee needs to request from data sources to respond to a given query.<n>Our analysis shows that PrivTru minimizes information leakage to the data trustee, regardless of the trustee's prior knowledge.
• Score: 2.7163621600184777
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Data trustees serve as intermediaries that facilitate secure data sharing between independent parties. This paper offers a technical perspective on Data trustees, guided by privacy-by-design principles. We introduce PrivTru, an instantiation of a data trustee that provably achieves optimal privacy properties. Therefore, PrivTru calculates the minimal amount of information the data trustee needs to request from data sources to respond to a given query. Our analysis shows that PrivTru minimizes information leakage to the data trustee, regardless of the trustee's prior knowledge, while preserving the utility of the data.

Related papers

• Privacy-Preserving Data Management using Blockchains [0.0]
  Data providers need to control and update existing privacy preferences due to changing data usage. This paper proposes a blockchain-based methodology for preserving data providers private and sensitive data.
  arXiv  Detail & Related papers  (2024-08-21T01:10:39Z)
• Protecting Data Buyer Privacy in Data Markets [27.092529976384238]
  The paramount concern of privacy has predominantly centered on protecting privacy of data owners and third parties. In this article, we address this gap by modeling the intricacies of data buyer privacy protection and investigating the delicate balance between privacy and purchase cost.
  arXiv  Detail & Related papers  (2024-07-13T04:45:06Z)
• Collection, usage and privacy of mobility data in the enterprise and public administrations [55.2480439325792]
  Security measures such as anonymization are needed to protect individuals' privacy. Within our study, we conducted expert interviews to gain insights into practices in the field. We survey privacy-enhancing methods in use, which generally do not comply with state-of-the-art standards of differential privacy.
  arXiv  Detail & Related papers  (2024-07-04T08:29:27Z)
• $\alpha$-Mutual Information: A Tunable Privacy Measure for Privacy Protection in Data Sharing [4.475091558538915]
  This paper adopts Arimoto's $alpha$-Mutual Information as a tunable privacy measure. We formulate a general distortion-based mechanism that manipulates the original data to offer privacy protection.
  arXiv  Detail & Related papers  (2023-10-27T16:26:14Z)
• How Do Input Attributes Impact the Privacy Loss in Differential Privacy? [55.492422758737575]
  We study the connection between the per-subject norm in DP neural networks and individual privacy loss. We introduce a novel metric termed the Privacy Loss-Input Susceptibility (PLIS) which allows one to apportion the subject's privacy loss to their input attributes.
  arXiv  Detail & Related papers  (2022-11-18T11:39:03Z)
• Privacy Explanations - A Means to End-User Trust [64.7066037969487]
  We looked into how explainability might help to tackle this problem. We created privacy explanations that aim to help to clarify to end users why and for what purposes specific data is required. Our findings reveal that privacy explanations can be an important step towards increasing trust in software systems.
  arXiv  Detail & Related papers  (2022-10-18T09:30:37Z)
• Certified Data Removal in Sum-Product Networks [78.27542864367821]
  Deleting the collected data is often insufficient to guarantee data privacy. UnlearnSPN is an algorithm that removes the influence of single data points from a trained sum-product network.
  arXiv  Detail & Related papers  (2022-10-04T08:22:37Z)
• Algorithms with More Granular Differential Privacy Guarantees [65.3684804101664]
  We consider partial differential privacy (DP), which allows quantifying the privacy guarantee on a per-attribute basis. In this work, we study several basic data analysis and learning tasks, and design algorithms whose per-attribute privacy parameter is smaller that the best possible privacy parameter for the entire record of a person.
  arXiv  Detail & Related papers  (2022-09-08T22:43:50Z)
• Ride Sharing & Data Privacy: An Analysis of the State of Practice [0.0]
  We analyzed how popular ride sharing services handle user privacy to assess the current state of practice. The results show that services include a varying set of personal data and offer limited privacy-related features.
  arXiv  Detail & Related papers  (2021-10-18T11:06:06Z)
• Towards practical differentially private causal graph discovery [74.7791110594082]
  Causal graph discovery refers to the process of discovering causal relation graphs from purely observational data. We present a differentially private causal graph discovery algorithm, Priv-PC, which improves both utility and running time compared to the state-of-the-art.
  arXiv  Detail & Related papers  (2020-06-15T18:30:41Z)
• Utility-aware Privacy-preserving Data Releasing [7.462336024223669]
  We propose a two-step perturbation-based privacy-preserving data releasing framework. First, certain predefined privacy and utility problems are learned from the public domain data. We then leverage the learned knowledge to precisely perturb the data owners' data into privatized data.
  arXiv  Detail & Related papers  (2020-05-09T05:32:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.