An Associated Deletion Scheme for Multi-copy in Cloud Storage

被引:3
作者
Dulin [1 ]
Zhang, Zhiwei [1 ]
Tan, Shichong [1 ]
Wang, Jianfeng [1 ]
Tao, Xiaoling [2 ,3 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks ISN, Xian, Peoples R China
[2] Guilin Univ Elect Technol, Guangxi Cooperat Innovat Ctr Cloud Comp & Big Dat, Guilin, Peoples R China
[3] Guilin Univ Elect Technol, Guangxi Coll & Univ Key Lab Cloud Comp & Complex, Guilin, Peoples R China
来源
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2018, PT IV | 2018年 / 11337卷
基金
中国国家自然科学基金;
关键词
Cloud storage; Multi-copy storage; Associated deletion; Pre-deleting sequence; OUTSOURCED DATABASE; SEARCH;
D O I
10.1007/978-3-030-05063-4_38
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud storage reduces the cost of data storage and brings great convenience for data backup, therefore in order to improve data availability, more and more users choose to outsource personal data for multiple copies instead of storing them locally. However, multi-copy storage brings the difficulty in associating all the copies to store, increases the number of keys for encrypting every single copy and makes the integrity and the verifiable deletion of copies hard to be guaranteed, all of these issues introduce more threatens to the security of user data. In this paper, we present a cryptographic solution called ADM to solve above problems. To reduce management cost, we outsource data keys encrypted by blinded RSA to the third party, and not only to guarantee the integrity of multi-copy but also to give the verifiable evidence for deletion operation of the copies, we propose a multi-copy associated deleting solution based on pre-deleting sequence and Merkle hash tree. Finally, a proof-of-concept implementation of ADM is presented to demonstrate its practical feasibility, and we compare our scheme with other typical schemes in functionalities and conduct the security analysis and empirical performance of the prototype.
引用
收藏
页码:511 / 526
页数:16
相关论文
共 31 条
[1]  
Abdalla M, 2001, LECT NOTES COMPUT SC, V2020, P143
[2]  
[Anonymous], 2013, P 2013 ACM SIGSAC C
[3]  
Armbrust M, 2009, UCBEECS200928
[4]   New Algorithms for Secure Outsourcing of Modular Exponentiations [J].
Chen, Xiaofeng ;
Li, Jin ;
Ma, Jianfeng ;
Tang, Qiang ;
Lou, Wenjing .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (09) :2386-2396
[5]   A Survey of Confidential Data Storage and Deletion Methods [J].
Diesburg, Sarah M. ;
Wang, An-I Andy .
ACM COMPUTING SURVEYS, 2010, 43 (01)
[6]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[7]   HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS [J].
FIAT, A ;
SHAMIR, A .
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 :186-194
[8]  
Geambasu Roxana., 2009, Proceedings of the 18th Conference on USENIX Security Symposium, P299
[9]  
Goldreich O., 2009, FDN CRYPTOGRAPHY, V2
[10]  
Golle P, 2001, LECT NOTES COMPUT SC, V2020, P425