Secure Deduplication with Efficient and Reliable Convergent Key Management

被引:352
作者
Li, Jin [1 ,2 ]
Chen, Xiaofeng [2 ,3 ]
Li, Mingqiang [4 ]
Li, Jingwei [5 ]
Lee, Patrick P. C. [4 ]
Lou, Wenjing [2 ]
机构
[1] Guangzhou Univ, Sch Comp Sci, Guangzhou, Guangdong, Peoples R China
[2] Virginia Polytech Inst & State Univ, Dept Comp Sci, Blacksburg, VA 24061 USA
[3] Xidian Univ, State Key Lab Integrated Serv Networks ISN, Xian, Peoples R China
[4] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
[5] Nankai Univ, Coll Informat Tech Sci, Tianjin, Peoples R China
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Deduplication; proof of ownership; convergent encryption; key management;
D O I
10.1109/TPDS.2013.284
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Data deduplication is a technique for eliminating duplicate copies of data, and has been widely used in cloud storage to reduce storage space and upload bandwidth. Promising as it is, an arising challenge is to perform secure deduplication in cloud storage. Although convergent encryption has been extensively adopted for secure deduplication, a critical issue of making convergent encryption practical is to efficiently and reliably manage a huge number of convergent keys. This paper makes the first attempt to formally address the problem of achieving efficient and reliable key management in secure deduplication. We first introduce a baseline approach in which each user holds an independent master key for encrypting the convergent keys and outsourcing them to the cloud. However, such a baseline key management scheme generates an enormous number of keys with the increasing number of users and requires users to dedicatedly protect the master keys. To this end, we propose Dekey, a new construction in which users do not need to manage any keys on their own but instead securely distribute the convergent key shares across multiple servers. Security analysis demonstrates that Dekey is secure in terms of the definitions specified in the proposed security model. As a proof of concept, we implement Dekey using the Ramp secret sharing scheme and demonstrate that Dekey incurs limited overhead in realistic environments.
引用
收藏
页码:1615 / 1625
页数:11
相关论文
共 30 条
[1]  
Anderson PO, 2010, PHARMACY INFORMATICS, P1, DOI 10.1145/1852658.1852665
[2]  
[Anonymous], 2012, DIGITAL UNIVERSE 202
[3]  
[Anonymous], 1981, TRCSE0301 HARV U CTR
[4]  
Bellare M., 2012, P IACR CRYPT EPRINT
[5]  
Blakley C., 1985, Advances in Cryptology, P242
[6]  
Clements A.T., 2009, P 2009 C USENIX ANN, P8
[7]   Multiple ramp schemes [J].
De Santis, A ;
Masucci, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1720-1728
[8]   Reclaiming space from duplicate files in a serverless distributed file system [J].
Douceur, JR ;
Adya, A ;
Bolosky, WJ ;
Simon, D ;
Theimer, M .
22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, :617-624
[9]  
Geambasu Roxana, 2009, USENIX SECURITY S, V316
[10]   Proofs of Ownership in Remote Storage Systems [J].
Halevi, Shai ;
Harnik, Danny ;
Pinkas, Benny ;
shulman-peleg, Alexandra .
PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11), 2011, :491-500