DROPS: Division and Replication of Data in Cloud for Optimal Performance and Security

被引:27
作者
Ali, Mazhar [1 ]
Bilal, Kashif [1 ]
Khan, Samee U. [2 ]
Veeravalli, Bharadwaj [3 ]
Li, Keqin [4 ]
Zomaya, Albert Y. [5 ]
机构
[1] COMSATS Inst Informat Technol, Dept Comp Sci, Abbottabad, Pakistan
[2] North Dakota State Univ, Dept Elect & Comp Engn, Fargo, ND 58108 USA
[3] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore, Singapore
[4] SUNY Coll New Paltz, Dept Comp Sci, New Paltz, NY 12561 USA
[5] Univ Sydney, Sch Informat Technol, Sydney, NSW 2006, Australia
基金
美国国家科学基金会;
关键词
Centrality; cloud security; fragmentation; replication; performance;
D O I
10.1109/TCC.2015.2400460
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Outsourcing data to a third-party administrative control, as is done in cloud computing, gives rise to security concerns. The data compromise may occur due to attacks by other users and nodes within the cloud. Therefore, high security measures are required to protect data within the cloud. However, the employed security strategy must also take into account the optimization of the data retrieval time. In this paper, we propose division and replication of data in the cloud for optimal performance and security (DROPS) that collectively approaches the security and performance issues. In the DROPS methodology, we divide a file into fragments, and replicate the fragmented data over the cloud nodes. Each of the nodes stores only a single fragment of a particular data file that ensures that even in case of a successful attack, no meaningful information is revealed to the attacker. Moreover, the nodes storing the fragments, are separated with certain distance by means of graph T-coloring to prohibit an attacker of guessing the locations of the fragments. Furthermore, the DROPS methodology does not rely on the traditional cryptographic techniques for the data security; thereby relieving the system of computationally expensive methodologies. We show that the probability to locate and compromise all of the nodes storing the fragments of a single file is extremely low. We also compare the performance of the DROPS methodology with 10 other schemes. The higher level of security with slight performance overhead was observed.
引用
收藏
页码:303 / 315
页数:13
相关论文
共 24 条
[1]   SeDaSC: Secure Data Sharing in Clouds [J].
Ali, Mazhar ;
Dhamotharan, Revathi ;
Khan, Eraj ;
Khan, Samee U. ;
Vasilakos, Athanasios V. ;
Li, Keqin ;
Zomaya, Albert Y. .
IEEE SYSTEMS JOURNAL, 2017, 11 (02) :395-404
[2]   Security in cloud computing: Opportunities and challenges [J].
Ali, Mazhar ;
Khan, Samee U. ;
Vasilakos, Athanasios V. .
INFORMATION SCIENCES, 2015, 305 :357-383
[3]  
[Anonymous], CMUCS01120
[4]  
[Anonymous], 2009, NETWORKS INTRO
[5]   On the Characterization of the Structural Robustness of Data Center Networks [J].
Bilal, Kashif ;
Manzano, Marc ;
Khan, Samee U. ;
Calle, Eusebi ;
Li, Keqin ;
Zomaya, Albert Y. .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2013, 1 (01) :64-77
[6]   Quantitative comparisons of the state-of-the-art data center architectures [J].
Bilal, Kashif ;
Khan, Samee U. ;
Zhang, Limin ;
Li, Hongxiang ;
Hayat, Khizar ;
Madani, Sajjad A. ;
Min-Allah, Nasro ;
Wang, Lizhe ;
Chen, Dan ;
Iqbal, Majid ;
Xu, Cheng-Zhong ;
Zomaya, Albert Y. .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2013, 25 (12) :1771-1783
[7]  
Boru D, 2013, IEEE GLOBE WORK, P446, DOI 10.1109/GLOCOMW.2013.6825028
[8]  
Deswarte Y., 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy (Cat. No.91CH2986-8), P110, DOI 10.1109/RISP.1991.130780
[9]   Understanding Cloud Computing Vulnerabilities [J].
Grobauer, Bernd ;
Walloschek, Tobias ;
Stoecker, Elmar .
IEEE SECURITY & PRIVACY, 2011, 9 (02) :50-57
[10]   FREQUENCY ASSIGNMENT - THEORY AND APPLICATIONS [J].
HALE, WK .
PROCEEDINGS OF THE IEEE, 1980, 68 (12) :1497-1514