arrow
返回

Secure and efficient ownership verification for deduplicated cloud computing systems

delete2025-04-10
delete0
delete
OA
AI
J
Jay Dave *
K
Kamalesh Ram R.
P
Pratik Patil
H
Himanshu Patil
S
Sarvesh Borole
S
Subhrakanta Panda
DOI:10.1186/s13677-025-00743-ydelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Cloud storage services offer a scalable platform to store a large amount of data at a low cost. It attracts a large number of customers to outsource their data to the cloud. To manage the massive growth in the size of outsourced data, cloud service providers employ deduplication, i.e., a technique to reduce space and bandwidth requirements by eliminating the upload and storage of redundant data. However, it poses the following severe security threat: A malicious user who learns deduplication tag of the file, i.e., a small piece of information, can convince the server to allow access to the entire file. A proof of ownership (POW) concept was introduced that allows the server to challenge the user to prove that s/he owns the entire file. The existing state-of-the-art POW solutions are either not considering the complete file for determining the proof or not efficient in terms of I/O, communication, and computational overheads on the user. In this paper, we propose a secure and efficient POW scheme. The proposed scheme ensures that the user must possess the complete file to generate ownership proof. In addition, our scheme causes minimal I/O, communication, and computational overhead on the user side. We implement the proposed scheme in a real cloud scenario using Google Firebase cloud services. The performance analysis indicates that our scheme is efficient in terms of I/O, computational, and communication overheads than the existing state-of-the-art solutions.
Keyword:
Cloud computing
Deduplication
Proof of ownership

期刊

J
Journal of Cloud Computing-Advances Systems and Applications
IF:
4.3
论文数:
752
被引数:
2.2K

机构

B
birla institute of technology & science pilani (bits pilani)
学者数:
6.5K
论文数: 5.1K
被引数: 10
引用论文

引用论文

暂无论文信息