An Efficient Secure Distributed Cloud Storage for Append-only Data
Binanda Sengupta, Nishant Nikam, Sushmita Ruj, Srinivasan, Narayanamurthy, and Siddhartha Nandi

TL;DR
This paper introduces a secure, efficient distributed cloud storage scheme tailored for append-only data, allowing servers to update parity blocks independently without client download, enhancing security and performance.
Contribution
It presents a novel scheme for append-only data in distributed cloud storage that enables server-side parity updates without client involvement, addressing key challenges in secure data management.
Findings
Scheme supports server-side parity updates
No client data download needed for tag updates
Security and performance are thoroughly analyzed
Abstract
Cloud computing enables users (clients) to outsource large volume of their data to cloud servers. Secure distributed cloud storage schemes ensure that multiple servers store these data in a reliable and untampered fashion. We propose an idea to construct such a scheme for static data by encoding data blocks (using error-correcting codes) and then attaching authentication information (tags) to these encoded blocks. We identify some challenges while extending this idea to accommodate append-only data. Then, we propose our secure distributed cloud storage scheme for append-only data that addresses the challenges efficiently. The main advantage of our scheme is that it enables the servers to update the parity blocks themselves. Moreover, the client need not download any data (or parity) block to update the tags of the modified parity blocks residing on the servers. Finally, we analyze the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
