Privacy-preserving anomaly detection in the cloud for quality assured decision-making in smart cities

被引:14
作者
Alabdulatif, Abdulatif [1 ]
Khalil, Ibrahim [1 ]
Kumarage, Heshan [3 ]
Zomaya, Albert Y. [2 ]
Yi, Xun [1 ]
机构
[1] RMTT univ, Sch Sci, Comp Sci & Software Engn, Melbourne, Vic, Australia
[2] Univ Sydney, Sydney, NSW, Australia
[3] Monash Univ, Fac IT, Clayton, Vic, Australia
基金
澳大利亚研究理事会;
关键词
Secure data analysis; Smart cities; Anomaly detection; Fully homomorphic encryption; Cloud computing; FULLY HOMOMORPHIC ENCRYPTION; IDEAL LATTICES; SECURITY; MODELS; ERRORS;
D O I
10.1016/j.jpdc.2017.12.011
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Rapid urbanisation places extensive demands on city services and infrastructure that mandate innovative and sustainable solutions which increasingly involve streamlined monitoring, collection, storage and analysis of massive, heterogeneous data. Analytics services, such as anomaly detection, work to both extract knowledge and support decision-making mechanisms that enable smart functionality over such contexts. However, data privacy and data quality remain significant challenges to assuring the quality of decision-making. This paper introduces a scalable, cloud-based model to provide a privacy preserving anomaly detection service for quality assured decision-making in smart cities. Homomorphic encryption is employed to preserve data privacy during the analysis and MapReduce based distribution of tasks and parallelisation is used to overcome computational overheads associated with homomorphic encryption. Experiments demonstrate that a high level of accuracy is maintained for anomaly detection performed on encrypted data with the adopted distributed data processing approach significantly reducing associated computational overheads. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:209 / 223
页数:15
相关论文
共 39 条
[1]   Security in cloud computing: Opportunities and challenges [J].
Ali, Mazhar ;
Khan, Samee U. ;
Vasilakos, Athanasios V. .
INFORMATION SCIENCES, 2015, 305 :357-383
[2]  
[Anonymous], 2003, P 9 ACM SIGKDD INT C, DOI DOI 10.1145/956755.956776
[3]  
[Anonymous], IACR CRYPTOLOGY EPRI
[4]  
[Anonymous], 2010, LECT NOTES COMPUT SC, DOI DOI 10.1007/978-3-642-13190-5_1
[5]  
[Anonymous], IEEE SIGNAL PROCESS
[6]  
[Anonymous], 2012, P IFIP INT C TRUST M
[7]  
[Anonymous], P 24 AUSTR DAT C
[8]  
Brakerski Z., 2014, ACM Trans. on Com. T, V6, P13
[9]  
Brakerski Z, 2011, LECT NOTES COMPUT SC, V6841, P505, DOI 10.1007/978-3-642-22792-9_29
[10]   Efficient Fully Homomorphic Encryption from (Standard) LWE [J].
Brakerski, Zvika ;
Vaikuntanathan, Vinod .
2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, :97-106