Updatable Block-Level Message-Locked Encryption

被引:13
|
作者
Zhao, Yongjun [1 ]
Chow, Sherman S. M. [1 ]
机构
[1] Chinese Univ Hong Kong, Dept Informat Engn, Shatin, Hong Kong, Peoples R China
来源
PROCEEDINGS OF THE 2017 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIA CCS'17) | 2017年
关键词
incremental cryptography; message-locked encryption; Merkle-hash tree; random oracle model;
D O I
10.1145/3052973.3053012
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deduplication is a widely used technique for reducing storage space of cloud service providers. Yet, it is unclear how to support deduplication of encrypted data securely until the study of Bellare et al. on message-locked encryption (Eurocrypt 2013). Since then, there are many improvements such as strengthening its security, reducing client storage, etc. While updating a (shared) file is common, there is little attention on how to efficiently update large encrypted files in a remote storage with deduplication. To modify even a single bit, existing solutions require the trivial and expensive way of downloading and decrypting the large ciphertext. We initiate the study of updatable block-level message-locked encryption. We propose a provably secure construction that is efficiently updatable with O(log vertical bar F vertical bar) computational cost, where vertical bar F vertical bar is the file size. It also supports proofof-ownership, a nice feature which protects storage providers from being abused as a free content distribution network.
引用
收藏
页码:449 / 460
页数:12
相关论文
empty
未找到相关数据