Privacy-Preserving Hierarchical Anonymization Framework over Encrypted Data

• URL: http://arxiv.org/abs/2310.12401v1
• Date: Thu, 19 Oct 2023 01:08:37 GMT
• Title: Privacy-Preserving Hierarchical Anonymization Framework over Encrypted Data
• Authors: Jing Jia, Kenta Saito, Hiroaki Nishi,
• Abstract summary: This study proposes a hierarchical k-anonymization framework using homomorphic encryption and secret sharing composed of two types of domains. The experimental results show that connecting two domains can accelerate the anonymization process, indicating that the proposed secure hierarchical architecture is practical and efficient.
• Score: 0.061446808540639365
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Smart cities, which can monitor the real world and provide smart services in a variety of fields, have improved people's living standards as urbanization has accelerated. However, there are security and privacy concerns because smart city applications collect large amounts of privacy-sensitive information from people and their social circles. Anonymization, which generalizes data and reduces data uniqueness is an important step in preserving the privacy of sensitive information. However, anonymization methods frequently require large datasets and rely on untrusted third parties to collect and manage data, particularly in a cloud environment. In this case, private data leakage remains a critical issue, discouraging users from sharing their data and impeding the advancement of smart city services. This problem can be solved if the computational entity can perform the anonymization process without obtaining the original plain text. This study proposed a hierarchical k-anonymization framework using homomorphic encryption and secret sharing composed of two types of domains. Different computing methods are selected flexibly, and two domains are connected hierarchically to obtain higher-level anonymization results in an efficient manner. The experimental results show that connecting two domains can accelerate the anonymization process, indicating that the proposed secure hierarchical architecture is practical and efficient.

Related papers

• Evaluating Differentially Private Synthetic Data Generation in High-Stakes Domains [9.123834467375532]
  We explore the feasibility of using synthetic data generated from differentially private language models in place of real data to facilitate the development of NLP in high-stakes domains. Our results show that prior simplistic evaluations have failed to highlight utility, privacy, and fairness issues in the synthetic data.
  arXiv  Detail & Related papers  (2024-10-10T19:31:02Z)
• Smart Contract Coordinated Privacy Preserving Crowd-Sensing Campaigns [4.204990010424083]
  Crowd-sensing has emerged as a powerful data retrieval model, enabling diverse applications by leveraging active user participation. Traditional methods like data encryption and anonymization, while essential, may not fully address these issues. This paper proposes a system utilizing smart contracts and blockchain technologies to manage crowd-sensing campaigns.
  arXiv  Detail & Related papers  (2024-08-20T08:41:57Z)
• Robust Utility-Preserving Text Anonymization Based on Large Language Models [80.5266278002083]
  Text anonymization is crucial for sharing sensitive data while maintaining privacy. Existing techniques face the emerging challenges of re-identification attack ability of Large Language Models. This paper proposes a framework composed of three LLM-based components -- a privacy evaluator, a utility evaluator, and an optimization component.
  arXiv  Detail & Related papers  (2024-07-16T14:28:56Z)
• Consistent community detection in multi-layer networks with heterogeneous differential privacy [4.451479907610764]
  We propose a personalized edge flipping mechanism that allows data publishers to protect edge information based on each node's privacy preference. It can achieve differential privacy while preserving the community structure under the multi-layer degree-corrected block model. We show that better privacy protection of edges can be obtained for a proportion of nodes while allowing other nodes to give up their privacy.
  arXiv  Detail & Related papers  (2024-06-20T22:49:55Z)
• A Unified View of Differentially Private Deep Generative Modeling [60.72161965018005]
  Data with privacy concerns comes with stringent regulations that frequently prohibited data access and data sharing. Overcoming these obstacles is key for technological progress in many real-world application scenarios that involve privacy sensitive data. Differentially private (DP) data publishing provides a compelling solution, where only a sanitized form of the data is publicly released.
  arXiv  Detail & Related papers  (2023-09-27T14:38:16Z)
• A Trajectory K-Anonymity Model Based on Point Density and Partition [0.0]
  This paper develops a trajectory K-anonymity model based on Point Density and Partition (K PDP) It successfully resists re-identification attacks and reduces the data utility loss of the k-anonymized dataset.
  arXiv  Detail & Related papers  (2023-07-31T17:10:56Z)
• DP2-Pub: Differentially Private High-Dimensional Data Publication with Invariant Post Randomization [58.155151571362914]
  We propose a differentially private high-dimensional data publication mechanism (DP2-Pub) that runs in two phases. splitting attributes into several low-dimensional clusters with high intra-cluster cohesion and low inter-cluster coupling helps obtain a reasonable privacy budget. We also extend our DP2-Pub mechanism to the scenario with a semi-honest server which satisfies local differential privacy.
  arXiv  Detail & Related papers  (2022-08-24T17:52:43Z)
• Smooth Anonymity for Sparse Graphs [69.1048938123063]
  differential privacy has emerged as the gold standard of privacy, however, when it comes to sharing sparse datasets. In this work, we consider a variation of $k$-anonymity, which we call smooth-$k$-anonymity, and design simple large-scale algorithms that efficiently provide smooth-$k$-anonymity.
  arXiv  Detail & Related papers  (2022-07-13T17:09:25Z)
• Reinforcement Learning on Encrypted Data [58.39270571778521]
  We present a preliminary, experimental study of how a DQN agent trained on encrypted states performs in environments with discrete and continuous state spaces. Our results highlight that the agent is still capable of learning in small state spaces even in presence of non-deterministic encryption, but performance collapses in more complex environments.
  arXiv  Detail & Related papers  (2021-09-16T21:59:37Z)
• Swarm Differential Privacy for Purpose Driven Data-Information-Knowledge-Wisdom Architecture [2.38142799291692]
  We will explore the privacy protection of the broad Data-InformationKnowledge-Wisdom (DIKW) landscape. As differential privacy proved to be an effective data privacy approach, we will look at it from a DIKW domain perspective. Swarm Intelligence could effectively optimize and reduce the number of items in DIKW used in differential privacy.
  arXiv  Detail & Related papers  (2021-05-09T23:09:07Z)
• Differentially Private Multi-Agent Planning for Logistic-like Problems [70.3758644421664]
  This paper proposes a novel strong privacy-preserving planning approach for logistic-like problems. Two challenges are addressed: 1) simultaneously achieving strong privacy, completeness and efficiency, and 2) addressing communication constraints. To the best of our knowledge, this paper is the first to apply differential privacy to the field of multi-agent planning.
  arXiv  Detail & Related papers  (2020-08-16T03:43:09Z)

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.