Dynamic and Public Auditing with Fair Arbitration for Cloud Data

被引:61
作者
Jin, Hao [1 ]
Jiang, Hong [2 ]
Zhou, Ke [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Hubei, Peoples R China
[2] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE 68588 USA
基金
中国国家自然科学基金;
关键词
Integrity auditing; public verifiability; dynamic update; arbitration; fairness; DATA POSSESSION; CHECKING; PROOFS;
D O I
10.1109/TCC.2016.2525998
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cloud users no longer physically possess their data, so how to ensure the integrity of their outsourced data becomes a challenging task. Recently proposed schemes such as "provable data possession" and "proofs of retrievability" are designed to address this problem, but they are designed to audit static archive data and therefore lack of data dynamics support. Moreover, threat models in these schemes usually assume an honest data owner and focus on detecting a dishonest cloud service provider despite the fact that clients may also misbehave. This paper proposes a public auditing scheme with data dynamics support and fairness arbitration of potential disputes. In particular, we design an index switcher to eliminate the limitation of index usage in tag computation in current schemes and achieve efficient handling of data dynamics. To address the fairness problem so that no party can misbehave without being detected, we further extend existing threat models and adopt signature exchange idea to design fair arbitration protocols, so that any possible dispute can be fairly settled. The security analysis shows our scheme is provably secure, and the performance evaluation demonstrates the overhead of data dynamics and dispute arbitration are reasonable.
引用
收藏
页码:680 / 693
页数:14
相关论文
共 38 条
[1]  
[Anonymous], P 12 ANN NETW DISTR
[2]  
Asokan N, 1998, LECT NOTES COMPUT SC, V1403, P591, DOI 10.1007/BFb0054156
[3]  
Ateniese G., 2008, P 4 INT C SEC PRIV C, P1, DOI 10.1145/1460877.1460889
[4]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[5]   AN ALGORITHM FOR CONCURRENCY-CONTROL AND RECOVERY IN REPLICATED DISTRIBUTED DATABASES [J].
BERNSTEIN, PA ;
GOODMAN, N .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1984, 9 (04) :596-615
[6]   CHECKING THE CORRECTNESS OF MEMORIES [J].
BLUM, M ;
EVANS, W ;
GEMMELL, P ;
KANNAN, S ;
NAOR, M .
ALGORITHMICA, 1994, 12 (2-3) :225-244
[7]  
Boneh D, 2003, LECT NOTES COMPUT SC, V2656, P416
[8]  
Boneh D., 2001, LNCS, V2248, P514, DOI DOI 10.1007/3-540-45682-1_30
[9]  
Bowers KevinD., 2009, Proc. of ACM-CCSW '09, P43, DOI DOI 10.1145/1655008.1655015
[10]  
Chang EC, 2008, LECT NOTES COMPUT SC, V5283, P223