Full integrity and freshness for cloud data

被引:29
作者
Jin, Hao [1 ]
Zhou, Ke [1 ]
Jiang, Hong [2 ]
Lei, Dongliang [1 ]
Wei, Ronglei [1 ]
Li, Chunhua [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan, Hubei, Peoples R China
[2] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE USA
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2018年 / 80卷
基金
中国国家自然科学基金;
关键词
Confidentiality; Full integrity; Data freshness; Proofs of storage; Integrity auditing; BROADCAST ENCRYPTION; STORAGE;
D O I
10.1016/j.future.2016.06.013
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Data outsourcing relieves cloud users of the heavy burden of infrastructure management and maintenance. However, the handover of data control to untrusted cloud servers significantly complicates the security issues. Conventional signature verification widely adopted in cryptographic storage systems only guarantees the integrity of retrieved data, for those rarely or never accessed data, it does not work. This paper integrates proof of storage technique with data dynamics support into cryptographic storage design to provide full integrity for outsourced data. Besides, we provide instantaneously freshness check for retrieved data to defend against potential replay attacks. We achieve these goals by designing flexible block structures and combining broadcast encryption, key regression, Merkle hash tree and proof of storage together to provide a secure storage service for outsourced data. Experimental evaluation of our prototype shows that the cryptographic cost and throughput are reasonable and acceptable. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:640 / 652
页数:13
相关论文
共 45 条
[1]  
[Anonymous], 2006150 IACR CRYPT E
[2]  
[Anonymous], KEY REGRESSION ENABL
[3]  
[Anonymous], COMPUTER SECURITY ES
[4]  
[Anonymous], 1993, CRYPTO, DOI DOI 10.1007/3-540-48329-2
[5]  
[Anonymous], 2013, IEEE T COMPUT, DOI DOI 10.1109/TC.2011.245
[6]  
[Anonymous], USENIX ANN TECHN C A
[7]  
[Anonymous], P 9 NETW DISTR SYST
[8]  
[Anonymous], MSRTR201158 1
[9]  
[Anonymous], 1999, THESIS
[10]  
[Anonymous], CSJ0409034 ARXIV