TY - GEN
T1 - Privacy-Preserving and Updatable Block-Level Data Deduplication in Cloud Storage Services
AU - Shin, Hyungjune
AU - Koo, Dongyoung
AU - Shin, Youngjoo
AU - Hur, Junbeom
N1 - Funding Information:
This work was supported by Institute for Information & communications Technology Promotion(IITP) grant funded by the Korea government(MSIT) (No.2018-0-00269, A research on safe and convenient big data processing methods)
Publisher Copyright:
© 2018 IEEE.
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2018/9/7
Y1 - 2018/9/7
N2 - To achieve high storage saving, data deduplication techniques are widely used in many practical cloud storage services, which removes redundant data and keeps only a single copy of them. However, secure data deduplication over encrypted data is challenging since encryption may result in different ciphertexts even when the original messages are the same. Thus, message-locked encryption (MLE) is proposed to solve this issue and demonstrates that it is secure under the unpredictable message set. Since block-level deduplication can achieve more fine-grained storage saving, several block-level deduplication schemes that support updatability are also vividly proposed. However, the previous updatable block-level MLE schemes are vulnerable against brute-force attack when the message set is predictable. Since the size of a block is typically much less than an arbitrary size of a file, the predictability problem is a very important pragmatic concern which should be addressed in the block-level deduplication literature. In this paper, thus, we propose a novel secure block-level deduplication scheme that guarantees efficient data update and brute-force attack resilience even when messages are predictable with the rigorous security proof. Also, our performance evaluation shows that additional time and bandwidth usage can be minimized as the size of a block increases.
AB - To achieve high storage saving, data deduplication techniques are widely used in many practical cloud storage services, which removes redundant data and keeps only a single copy of them. However, secure data deduplication over encrypted data is challenging since encryption may result in different ciphertexts even when the original messages are the same. Thus, message-locked encryption (MLE) is proposed to solve this issue and demonstrates that it is secure under the unpredictable message set. Since block-level deduplication can achieve more fine-grained storage saving, several block-level deduplication schemes that support updatability are also vividly proposed. However, the previous updatable block-level MLE schemes are vulnerable against brute-force attack when the message set is predictable. Since the size of a block is typically much less than an arbitrary size of a file, the predictability problem is a very important pragmatic concern which should be addressed in the block-level deduplication literature. In this paper, thus, we propose a novel secure block-level deduplication scheme that guarantees efficient data update and brute-force attack resilience even when messages are predictable with the rigorous security proof. Also, our performance evaluation shows that additional time and bandwidth usage can be minimized as the size of a block increases.
KW - Brute-force attack
KW - Cloud security
KW - Secure deduplication
KW - Storage management
UR - http://www.scopus.com/inward/record.url?scp=85057493509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85057493509&partnerID=8YFLogxK
U2 - 10.1109/CLOUD.2018.00056
DO - 10.1109/CLOUD.2018.00056
M3 - Conference contribution
AN - SCOPUS:85057493509
T3 - IEEE International Conference on Cloud Computing, CLOUD
SP - 392
EP - 400
BT - Proceedings - 2018 IEEE International Conference on Cloud Computing, CLOUD 2018 - Part of the 2018 IEEE World Congress on Services
PB - IEEE Computer Society
T2 - 11th IEEE International Conference on Cloud Computing, CLOUD 2018
Y2 - 2 July 2018 through 7 July 2018
ER -