Secure proof of ownership for deduplicated cloud storage system Online publication date: Fri, 26-May-2023
by Jay Dave; Meghna Bhatt; Deep Pancholi
International Journal of Information and Computer Security (IJICS), Vol. 21, No. 1/2, 2023
Abstract: Deduplication is a popular data reduction technique that minimises storage and communication costs. However, in a deduplicated system, an adversary can obtain access to the entire file on the server by showing just hash of file. A standard solution is that the server sends a file-based challenge to verify the client's file-ownership. Unfortunately, in the state-of-the-art schemes, adversary can correctly respond to the challenge with knowledge of the hash of file-blocks, where |Hash(blocks)| < < |File|. In this paper, we propose a secure proof of ownership scheme. In our proposal, the server randomly selects a set of file-blocks as a challenge. Therefore, if the client knows the complete file, he can correctly respond and get file access. We derive lower bound for no. of blocks in challenge. We prove that adversary cannot get success by learning former challenges-responses. We implement our approach in a realistic environment and compare performance with the state-of-the-art schemes.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook