An innovative privacy preserving technique for incremental datasets on cloud computing

被引:21
作者
Aldeen, Yousra Abdul Alsahib S. [1 ]
Salleh, Mazleena [1 ]
Aljeroudi, Yazan [2 ]
机构
[1] Univ Teknol Malaysia, Fac Comp, Utm Skudai 81310, Johor, Malaysia
[2] Int Islamic Univ Malaysia, Jalan Gombak, Kuala Lumpur, Malaysia
关键词
Cloud computing; Privacy; Incremental datasets;
D O I
10.1016/j.jbi.2016.06.011
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Cloud computing (CC) is a magnificent service-based delivery with gigantic computer processing power and data storage across connected communications channels. It imparted overwhelming technological impetus in the internet (web) mediated IT industry, where users can easily share private data for further analysis and mining. Furthermore, user affable CC services enable to deploy sundry applications economically. Meanwhile, simple data sharing impelled various phishing attacks and malware assisted security threats. Some privacy sensitive applications like health services on cloud that are built with several economic and operational benefits necessitate enhanced security. Thus, absolute cyberspace security and mitigation against phishing blitz became mandatory to protect overall data privacy. Typically, diverse applications datasets are anonymized with better privacy to owners without providing all secrecy requirements to the newly added records. Some proposed techniques emphasized this issue by reanonymizing the datasets from the scratch. The utmost privacy protection over incremental datasets on CC is far from being achieved. Certainly, the distribution of huge datasets volume across multiple storage nodes limits the privacy preservation. In this view, we propose a new anonymization technique to attain better privacy protection with high data utility over distributed and incremental datasets on CC. The proficiency of data privacy preservation and improved confidentiality requirements is demonstrated through performance evaluation. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:107 / 116
页数:10
相关论文
共 38 条
  • [11] Fully Homomorphic Encryption Using Ideal Lattices
    Gentry, Craig
    [J]. STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 169 - 178
  • [12] He YY, 2011, PROC INT CONF DATA, P529, DOI 10.1109/ICDE.2011.5767924
  • [13] Kienzler R., 2012, Proceedings of the 2012 IEEE International Conference on Data Engineering Workshops (ICDEW 2012), P159, DOI 10.1109/ICDEW.2012.69
  • [14] LeFevre K., 2005, Multidimensional k-Anonymity
  • [15] LeFevre Kristen., 2005, Incognito: Efficient full-domain k-anonymity
  • [16] Periodic solutions for a singular damped differential equation
    Li, Jing
    Li, Shengjun
    Zhang, Ziheng
    [J]. BOUNDARY VALUE PROBLEMS, 2015,
  • [17] Authorized Private Keyword Search over Encrypted Data in Cloud Computing
    Li, Ming
    Yu, Shucheng
    Cao, Ning
    Lou, Wenjing
    [J]. 31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011), 2011, : 383 - 392
  • [18] Closeness: A New Privacy Measure for Data Publishing
    Li, Ninghui
    Li, Tiancheng
    Venkatasubramanian, Suresh
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (07) : 943 - 956
  • [19] Machanavajjhala A., 2007, ACM T KNOWL DISCOV D, V1, P3, DOI [DOI 10.1145/1217299.1217302, 10.1145/1217299.1217302]
  • [20] Manousakis V, 2013, LECT NOTES BUS INF P, V148, P455