Differential Privacy for Data and Model Publishing of Medical Data
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
Combining medical data and machine learning has fully utilized the value of medical data. However, medical data contain a large amount of sensitive information, and the inappropriate handling of data can lead to the leakage of personal privacy. Thus, both publishing data and training data in machine learning may reveal the privacy of patients. To address the above issue, we propose two effective approaches. One combines a differential privacy and decision tree (DPDT) approach to provide strong privacy guarantees for publishing data, which establishes a weight calculation system based on the classification and regression tree (CART) method and takes weights as a new element of differential privacy to participate in privacy protection and reduce the negative impact of differential privacy on data availability. Another uses the differentially private mini-batch gradient descent algorithm (DPMB) to provide strong protection for training data; it tracks the privacy loss and allows the model to satisfy differential privacy in the process of gradient descent to prevent attackers from invading personal privacy with the training data. It is worth mentioning that, in this paper, we adopt the data processed by DPDT as the training data of DPMB to further strengthen the privacy of data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2014) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000042 · Cited by 5,557
Membership Inference Attacks Against Machine Learning Models
Shokri, R., Stronati, M., Song, C., & Shmatikov, V. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.41 · Cited by 4,754 · cited 2×
“Such attacks can proceed directly by analyzing internal model parameters and indirectly by repeatedly querying models to gather data for the attack analysis, such as the model inversion (MI) attack [8], membership inference attack [9], etc.”
BackgroundThe Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451 · cited 2×
“Subsequently, L-diversity [6], T-closeness [7] and M-invariance [34] were proposed.”
BackgroundOur Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835 · cited 2×
“In this paper, we mainly use the basic composition theorem [16], [17] and advanced composition theorems [18]–[21] to repeatedly apply additive-noise mechanisms.”
MethodMironov, I. (2017) · 2017 IEEE 30th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf.2017.11 · Cited by 1,255 · cited 1×
“based on former foundations [20], [21], [24].”
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011) · SIAM Journal on Computing · doi:10.1137/090756090 · Cited by 898 · cited 1×
“The research on differential privacy can generally be divided into two directions: one is data publishing under privacy protection [13], [18], [35]–[45]; the other is privacy protection for machine learning [29], [40], [46]–[54].”
BackgroundBoosting and Differential Privacy
Dwork, C., Rothblum, G. N., & Vadhan, S. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.12 · Cited by 784 · cited 3×
“The research on differential privacy can generally be divided into two directions: one is data publishing under privacy protection [13], [18], [35]–[45]; the other is privacy protection for machine learning [29], [40], [46]–[54].”
BackgroundMethodSemi-supervised Knowledge Transfer for Deep Learning from Private Training Data
Papernot, N., Abadi, M., Erlingsson, Ú., Goodfellow, I., & Talwar, K. (2016) · arXiv · doi:10.48550/arxiv.1610.05755 · Cited by 492
The composition theorem for differential privacy
Kairouz, P., Oh, S., & Viswanath, P. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2685505 · Cited by 408
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307 · cited 1×
“Because medical data contain a large amount of sensitive information, it may reveal the privacy of patients both when publishing data and training data in machine learning [3], [4].”
BackgroundPrivate predictive analysis on encrypted medical data
Bos, J. W., Lauter, K., & Naehrig, M. (2014) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2014.04.003 · Cited by 283 · cited 1×
“Because medical data contain a large amount of sensitive information, it may reveal the privacy of patients both when publishing data and training data in machine learning [3], [4].”
Background
Cited by
Differential Privacy for Deep and Federated Learning: A Survey
Ouadrhiri, A. E., & Abdelhadi, A. (2022) · IEEE Access · doi:10.1109/access.2022.3151670 · Cited by 445
“…work can be divided into two categories: 1) The first category is the works producing pre-processing datasets balancing between accuracy and privacy for a specific learning model, such as frequent itemset mining models [71], [96], [97], and classi-fication and clustering models [53], [72], [98], [99].”
BackgroundA survey on differential privacy for medical data analysis
Liu, W., Zhang, Y., Yang, H., & Meng, Q. (2024) · Annals of Data Science · doi:10.1007/s40745-023-00475-3 · Cited by 66
Secure and robust machine learning for healthcare: A survey
Qayyum, A., Qadir, J., Bilal, M., & Al-Fuqaha, A. (2021) · IEEE Reviews in Biomedical Engineering · doi:10.1109/rbme.2020.3013489 · Cited by 59
Secure and Robust Machine Learning for Healthcare: A Survey
Qayyum, A., Qadir, J., Bilal, M., & Al-Fuqaha, A. (2020) · arXiv · doi:10.48550/arxiv.2001.08103 · Cited by 59
FEEL: A Federated Edge Learning System for Efficient and Privacy-Preserving Mobile Healthcare
Guo, Y., Liu, F., Cai, Z., Chen, L., & Xiao, N. (2020) · 49th International Conference on Parallel Processing - ICPP · doi:10.1145/3404397.3404410 · Cited by 52
Metadata
- Authors
- Sun, Z., Wang, Y., Shu, M., Liu, R., & Zhao, H.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 152103-152114
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2981195730
- Cited by
- 56
- References
- 13
- FWCI
- 2.76
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.