Fully Homomorphic based Privacy-Preserving Distributed Expectation Maximization on Cloud

被引:9
作者
Alabdulatif, Abdulatif [1 ]
Khalil, Ibrahim [2 ]
Zomaya, Albert Y. [3 ]
Tari, Zahir [4 ]
Yi, Xun [4 ]
机构
[1] Qassim Univ, Dept Comp Sci, Buraydah, Saudi Arabia
[2] Royal Melbourne Inst Technol RMIT Univ, Dept Distributed Syst & Networking, Melbourne, Vic 3000, Australia
[3] Univ Sydney, Sch Informat Technol, Camperdown, NSW 2006, Australia
[4] RMIT Univ, Sch Comp Sci & IT, Melbourne, Vic 3000, Australia
关键词
Cloud computing; Data models; Computational modeling; Data privacy; Analytical models; Signal processing algorithms; Clustering algorithms; Expectation maximization; distributed analytics; data privacy; fully homomorphic encryption; cloud computing; MAXIMUM-LIKELIHOOD; EM ALGORITHM;
D O I
10.1109/TPDS.2020.2999407
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Expectation maximization (EM) is a clustering-based machine learning algorithm that is widely used in many areas of science (e.g., bioinformatics and computer vision) to find maximum likelihood and maximum a posteriori estimates for models with latent variables. To deploy such an algorithm in cloud environments, security and privacy issues need be considered to avoid data breaches or abuses by external malicious parties or even by cloud service providers. However, the processing performance of the EM algorithm poses a challenge in terms of building a secure environment. This article describes an innovative and practical privacy-preserving EM algorithm for cloud systems that addresses this challenge, and estimates the EM parameters in an accurate and secure manner. Fully homomorphic encryption (FHE) is used to ensure the privacy of both the EM algorithm computations and the users' sensitive data in the cloud. A distributed-based approach is also proposed to overcome the overheads of FHE computations and ensure a fast convergence of the EM algorithm. The conducted experiments demonstrate a significant improvement in the convergence time of the distributed EM algorithm, while achieving a high level of accuracy and reducing the associated computational FHE overheads.
引用
收藏
页码:2668 / 2681
页数:14
相关论文
共 37 条
[1]  
Agrawal R, 2000, SIGMOD REC, V29, P439, DOI 10.1145/335191.335438
[2]   Towards secure big data analytic for cloud-enabled applications with fully homomorphic encryption [J].
Alabdulatif, Abdulatif ;
Khalil, Ibrahim ;
Yi, Xun .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2020, 137 :192-204
[3]  
Bailey TL, 1994, P 2 INT C INT SYST M, V2, P28
[4]  
Brakerski Z, 2011, LECT NOTES COMPUT SC, V6841, P505, DOI 10.1007/978-3-642-22792-9_29
[5]   Data-Driven Cyber Security in Perspective-Intelligent Traffic Analysis [J].
Coulter, Rory ;
Han, Qing-Long ;
Pan, Lei ;
Zhang, Jun ;
Xiang, Yang .
IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (07) :3081-3093
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]  
Doganay M.C., 2008, Proceedings of the 2008 international workshop on Privacy and anonymity in information society, P3
[8]   Spectrometric differentiation of yeast strains using minimum volume increase and minimum direction change clustering criteria [J].
Fachada, Nuno ;
Figueiredo, Mario A. T. ;
Lopes, Vitor V. ;
Martins, Rui C. ;
Rosa, Agostinho C. .
PATTERN RECOGNITION LETTERS, 2014, 45 :55-61
[9]   Expectation-Maximization-Driven Geodesic Active Contour With Overlap Resolution (EMaGACOR): Application to Lymphocyte Segmentation on Breast Cancer Histopathology [J].
Fatakdawala, Hussain ;
Xu, Jun ;
Basavanhally, Ajay ;
Bhanot, Gyan ;
Ganesan, Shridar ;
Feldman, Michael ;
Tomaszewski, John E. ;
Madabhushi, Anant .
IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING, 2010, 57 (07) :1676-1689
[10]   Model-based clustering, discriminant analysis, and density estimation [J].
Fraley, C ;
Raftery, AE .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2002, 97 (458) :611-631