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 条
[21]   A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection [J].
Li, Qinbin ;
Wen, Zeyi ;
Wu, Zhaomin ;
Hu, Sixu ;
Wang, Naibo ;
Li, Yuan ;
Liu, Xu ;
He, Bingsheng .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (04) :3347-3366
[22]   A Lightweight Secure Data Sharing Scheme for Mobile Cloud Computing [J].
Li, Ruixuan ;
Shen, Chenglin ;
He, Heng ;
Gu, Xiwu ;
Xu, Zhiyong ;
Xu, Cheng-Zhong .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2018, 6 (02) :344-357
[23]  
Li SW, 2019, PROCEEDINGS OF THE 28TH USENIX SECURITY SYMPOSIUM, P1357
[24]   Break the Data Barriers While Keeping Privacy: A Graph Differential Privacy Method [J].
Li, Yijing ;
Tao, Xiaofeng ;
Zhang, Xuefei ;
Wang, Mingsi ;
Wang, Shuo .
IEEE INTERNET OF THINGS JOURNAL, 2023, 10 (05) :3840-3850
[25]  
Lin ZA, 2023, Arxiv, DOI arXiv:2303.02014
[26]   Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT [J].
Lu, Yunlong ;
Huang, Xiaohong ;
Dai, Yueyue ;
Maharjan, Sabita ;
Zhang, Yan .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (06) :4177-4186
[27]  
Machanavajjhala A., 2007, ACM Transactions on Knowledge Discovery from Data (TKDD), V1, P3, DOI [DOI 10.1145/1217299.1217302, DOI 10.1109/ICDE.2006.1]
[28]   THE BIG CHALLENGES OF BIG DATA [J].
Marx, Vivien .
NATURE, 2013, 498 (7453) :255-260
[29]  
McMahan HB, 2017, PR MACH LEARN RES, V54, P1273
[30]  
Murakami T, 2019, PROCEEDINGS OF THE 28TH USENIX SECURITY SYMPOSIUM, P1877