Deriving an Optimal Noise Adding Mechanism for Privacy-Preserving Machine Learning

被引:13
作者
Kumar, Mohit [1 ,2 ]
Rossbory, Michael [2 ]
Moser, Bernhard A. [2 ]
Freudenthaler, Bernhard [2 ]
机构
[1] Univ Rostock, Fac Comp Sci & Elect Engn, Rostock, Germany
[2] Software Competence Ctr Hagenberg, Hagenberg, Austria
来源
DATABASE AND EXPERT SYSTEMS APPLICATIONS (DEXA 2019) | 2019年 / 1062卷
基金
欧盟地平线“2020”;
关键词
Privacy; Noise adding mechanism; Machine learning;
D O I
10.1007/978-3-030-27684-3_15
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Differential privacy is a standard mathematical framework to quantify the degree to which individual privacy in a statistical dataset is preserved. We derive an optimal (epsilon, delta)-differentially private noise adding mechanism for real-valued data matrices meant for the training of models by machine learning algorithms. The aim is to protect a machine learning algorithm from an adversary who seeks to gain an information about the data from algorithm's output by perturbing the value in a sample of the training data. The fundamental issue of trade-off between privacy and utility is addressed by presenting a novel approach consisting of three steps: (1) the sufficient conditions on the probability density function of noise for (epsilon, delta)-differential privacy of a machine learning algorithm are derived; (2) the noise distribution that, for a given level of entropy, minimizes the expected noise magnitude is derived; (3) using entropy level as the design parameter, the optimal entropy level and the corresponding probability density function of the noise are derived.
引用
收藏
页码:108 / 118
页数:11
相关论文
共 50 条
[31]   Privacy-Preserving Split Learning via Pareto Optimal Search [J].
Yu, Xi ;
Xiang, Liyao ;
Wang, Shiming ;
Long, Chengnian .
COMPUTER SECURITY - ESORICS 2023, PT IV, 2024, 14347 :123-142
[32]   Scalable Unified Privacy-Preserving Machine Learning Framework (SUPM) [J].
Miyaji, Atsuko ;
Yamatsuki, Tatsuhiro ;
Takahashi, Tomoka ;
Wang, Ping-Lun ;
Mimoto, Tomoaki .
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2025, E108A (03) :423-434
[33]   PROV-FL: Privacy-preserving Round Optimal Verifiable Federated Learning [J].
Dasu, Vishnu Asutosh ;
Sarkar, Sumanta ;
Mandal, Kalikinkar .
PROCEEDINGS OF THE 15TH ACM WORKSHOP ON ARTIFICIAL INTELLIGENCE AND SECURITY, AISEC 2022, 2022, :33-44
[34]   A Privacy-Preserving Framework for Collaborative Machine Learning with Kernel methods [J].
Hannemann, Anika ;
Uenal, Ali Burak ;
Swaminathan, Arjhun ;
Buchmann, Erik ;
Akguen, Mete .
2023 5TH IEEE INTERNATIONAL CONFERENCE ON TRUST, PRIVACY AND SECURITY IN INTELLIGENT SYSTEMS AND APPLICATIONS, TPS-ISA, 2023, :82-90
[35]   Efficient Secure Aggregation for Privacy-Preserving Federated Machine Learning [J].
Behnia, Rouzbeh ;
Riasi, Arman ;
Ebrahimi, Reza ;
Chow, Sherman S. M. ;
Padmanabhan, Balaji ;
Hoang, Thang .
2024 ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, ACSAC, 2024, :778-793
[36]   Towards Practical Secure Privacy-Preserving Machine (Deep) Learning with Distributed Data [J].
Kumar, Mohit ;
Moser, Bernhard ;
Fischer, Lukas ;
Freudenthaler, Bernhard .
DATABASE AND EXPERT SYSTEMS APPLICATIONS, DEXA 2022 WORKSHOPS, 2022, 1633 :55-66
[37]   Privacy-Preserving Distributed Machine Learning via Local Randomization and ADMM Perturbation [J].
Wang, Xin ;
Ishii, Hideaki ;
Du, Linkang ;
Cheng, Peng ;
Chen, Jiming .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 :4226-4241
[38]   PPMLP 2020: Workshop on Privacy-Preserving Machine Learning in Practice [J].
Zhang, Benyu ;
Zaharia, Matei ;
Ji, Shouling ;
Popa, Raluca Ada ;
Gu, Guofei .
CCS '20: PROCEEDINGS OF THE 2020 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2020, :2139-2140
[39]   CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning [J].
So, Jinhyun ;
Guler, Basak ;
Avestimehr, A. Salman .
IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY, 2021, 2 (01) :441-451
[40]   Privacy-Preserving Classifier Learning [J].
Brickell, Justin ;
Shmatikov, Vitaly .
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, 2009, 5628 :128-147