Privacy Passport: Privacy-Preserving Cross-Domain Data Sharing

被引:0
作者
Chen, Xue [1 ,2 ]
Wang, Cheng [1 ,2 ]
Yang, Qing [1 ,2 ]
Teng, Hu [1 ,2 ]
Jiang, Changjun [1 ,2 ]
机构
[1] Tongji Univ, Key Lab Embedded Syst & Serv Comp, Minist Educ, Shanghai 201804, Peoples R China
[2] Shanghai Artificial Intelligence Lab, Shanghai 200030, Peoples R China
关键词
Data privacy; Privacy; Protection; Data models; Collaboration; Noise; Servers; Organizations; Costs; Training; Cross-domain; data sharing; privacy-preserving; local differential privacy;
D O I
10.1109/TIFS.2024.3515797
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Data sharing facilitates the integration and in-depth exploration of cross-domain data, thereby fostering innovative research and model development. However, privacy leakage emerges as a critical barrier to the sharing and circulating of such data. Existing privacy-preserving technologies face challenges in handling complex scenarios involving multiple participants due to the following reasons: 1) Divergent privacy permission. Data sharing is constrained by various privacy limitations, necessitating the consideration of privacy permissions across different domains, akin to a cross-border process. 2) High collaboration cost. Collaboration among multiple domains to determine the privacy constraint and sharing ways incur additional costs. 3) Large noise magnitude. Traditional privacy techniques to protect the privacy of a single domain using local differential privacy (LDP) may introduce excessive noise, thereby reducing data utility. Drawing inspiration from the cross-border visa issuance process, we present an innovative framework called PriVisa for enabling privacy-preserving data sharing across different domains. It consists of four key modules to overcome the mentioned challenges: the hybrid pattern, optimized sharing path construction, personalized grouping, and LDP-based perturbation. 1) The hybrid pattern for coordination among organizations, considering authentication, privacy constraints, and sharing methods. 2) The optimized sharing path construction using a privacy constraint hierarchy tree to maximize data utility while adhering to privacy requirements. 3) The feature similarity grouping and perturbing mechanism satisfying LDP to protect privacy and optimize data utility. The theoretical and experimental validation confirms PriVisa's effectiveness in addressing divergent privacy constraints and promoting data utility in cross-domain data sharing.
引用
收藏
页码:636 / 650
页数:15
相关论文
共 51 条
[1]  
Adleman L., 1978, Found. Secure Comput, V4, P169, DOI DOI 10.4067/S0716-078X2003000400011
[2]   Privacy-Preserving Parametric Inference: A Case for Robust Statistics [J].
Avella-Medina, Marco .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2021, 116 (534) :969-983
[3]   Secure Multi-party Computation of Differentially Private Heavy Hitters [J].
Boehler, Jonas ;
Kerschbaum, Florian .
CCS '21: PROCEEDINGS OF THE 2021 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2021, :2361-2377
[4]  
Böhler J, 2020, PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, P2147
[5]  
Canetti R., 1996, Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, P639, DOI 10.1145/237814.238015
[6]  
Duchi J. C., 2013, Comput. Sci.
[7]   Minimax Optimal Procedures for Locally Private Estimation [J].
Duchi, John C. ;
Jordan, Michael I. ;
Wainwright, Martin J. .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2018, 113 (521) :182-201
[8]  
Dwork C., 2016, J PRIVACY CONFIDENTI, V7, P17, DOI DOI 10.29012/JPC.V7I3.405
[9]  
Dwork C, 2006, LECT NOTES COMPUT SC, V4052, P1
[10]   The Power of Factorization Mechanisms in Local and Central Differential Privacy [J].
Edmonds, Alexander ;
Nikolov, Aleksandar ;
Ullman, Jonathan .
PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, :425-438