Task-Specific Adaptive Differential Privacy Method for Structured Data

Author:

Utaliyeva Assem1ORCID,Shin Jinmyeong1ORCID,Choi Yoon-Ho1ORCID

Affiliation:

1. School of Computer Science and Engineering, Pusan National University, Busan 609-735, Republic of Korea

Abstract

Data are needed to train machine learning (ML) algorithms, and in many cases often include private datasets that contain sensitive information. To preserve the privacy of data used while training ML algorithms, computer scientists have widely deployed anonymization techniques. These anonymization techniques have been widely used but are not foolproof. Many studies showed that ML models using anonymization techniques are vulnerable to various privacy attacks willing to expose sensitive information. As a privacy-preserving machine learning (PPML) technique that protects private data with sensitive information in ML, we propose a new task-specific adaptive differential privacy (DP) technique for structured data. The main idea of the proposed DP method is to adaptively calibrate the amount and distribution of random noise applied to each attribute according to the feature importance for the specific tasks of ML models and different types of data. From experimental results under various datasets, tasks of ML models, different DP mechanisms, and so on, we evaluate the effectiveness of the proposed task-specific adaptive DP method. Thus, we show that the proposed task-specific adaptive DP technique satisfies the model-agnostic property to be applied to a wide range of ML tasks and various types of data while resolving the privacy–utility trade-off problem.

Funder

BK21 FOUR, Korean Southeast Center for the 4th Industrial Revolution Leader Education

Publisher

MDPI AG

Subject

Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry

Reference33 articles.

1. Facebook fined $5 billion by FTC, must update and adopt new privacy, security measures;Snider;USA Today,2019

2. Samarati, P., and Sweeney, L. (1998). Protecting Privacy When Disclosing Information: K-Anonymity and Its Enforcement through Generalization and Suppression, Computer Science Laboratory SRI International. Available online: http://www.csl.sri.com/papers/sritr-98-04/.

3. k-anonymity: A model for protecting privacy;Sweeney;Int. J. Uncertain. Fuzziness Knowl.-Based Syst.,2002

4. l-diversity: Privacy beyond k-anonymity;Machanavajjhala;ACM Trans. Knowl. Discov. Data (TKDD),2007

5. Li, N., Li, T., and Venkatasubramanian, S. (2007, January 17–20). t-closeness: Privacy beyond k-anonymity and l-diversity. Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering, Istanbul, Turkey.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Optimization Scheme for Privacy Protection on Cloud Platforms Based on Data Classification;2024 IEEE 7th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC);2024-03-15

2. SSKM_DP: Differential Privacy Data Publishing Method via SFLA-Kohonen Network;Applied Sciences;2023-03-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3