Proofs of Ownership in Remote Storage Systems

被引:300
作者
Halevi, Shai [1 ]
Harnik, Danny [2 ]
Pinkas, Benny [3 ]
shulman-peleg, Alexandra [2 ]
机构
[1] IBM TJ Watson Res Ctr, Ossining, NY 10562 USA
[2] IBM Haifa Res Labs, Haifa, Israel
[3] Bar Ilan Univ, IL-52100 Ramat Gan, Israel
来源
PROCEEDINGS OF THE 18TH ACM CONFERENCE ON COMPUTER & COMMUNICATIONS SECURITY (CCS 11) | 2011年
基金
欧洲研究理事会;
关键词
Cloud storage; Deduplication; Merkle trees; Proofs of ownership;
D O I
10.1145/2046707.2046765
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Cloud storage systems are becoming increasingly popular. A promising technology that keeps their cost down is deduplication, which stores only a single copy of repeating data. Client-side deduplication attempts to identify deduplication opportunities already at the client and save the bandwidth of uploading copies of existing files to the server. In this work we identify attacks that exploit client-side deduplication, allowing an attacker to gain access to arbitrarysize files of other users based on a very small hash signatures of these files. More specifically, an attacker who knows the hash signature of a file can convince the storage service that it owns that file, hence the server lets the attacker download the entire file. (In parallel to our work, a subset of these attacks were recently introduced in the wild with respect to the Dropbox file synchronization service.) To overcome such attacks, we introduce the notion of proofs-of-ownership (PoWs), which lets a client efficiently prove to a server that that the client holds a file, rather than just some short information about it. We formalize the concept of proof-of-ownership, under rigorous security definitions, and rigorous efficiency requirements of Petabyte scale storage systems. We then present solutions based on Merkle trees and specific encodings, and analyze their security. We implemented one variant of the scheme. Our performance measurements indicate that the scheme incurs only a small overhead compared to naive client-side deduplication.
引用
收藏
页码:491 / 500
页数:10
相关论文
共 19 条
[1]  
Akamai, 2010, STAT INT
[2]  
[Anonymous], 2009, UNDERSTANDING DATA D
[3]  
Ateniese G, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P598
[4]  
Bowers KD, 2009, CCS'09: PROCEEDINGS OF THE 16TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P187
[5]  
Dai W., 2011, CRYPTO LIB 5 6 1
[6]  
Di Crescenzo G, 2006, LECT NOTES COMPUT SC, V3876, P225
[7]  
Dziembowski S, 2006, LECT NOTES COMPUT SC, V3876, P207
[8]  
Elbaz R, 2009, LECT NOTES COMPUT SC, V5430, P1, DOI 10.1007/978-3-642-01004-0_1
[9]   THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS [J].
GOLDWASSER, S ;
MICALI, S ;
RACKOFF, C .
SIAM JOURNAL ON COMPUTING, 1989, 18 (01) :186-208
[10]  
Golle P, 2003, LECT NOTES COMPUT SC, V2357, P120