Dynamic PoR Audit Bandwidth Reduction via Erasure-Coded Authenticated Log
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing dynamic Proofs of Retrievability (PoR) schemes face inefficiencies in secure and efficient updates of outsourced data, as they often require affecting a significant portion of the data to prevent server misbehavior, leading to high communication costs and security vulnerabilities.
Innovation Solution
A dynamic PoR scheme is developed using black-box access to a DPDP and a static PoR scheme, incorporating an Erasure-Coded Authenticated Log (ECAL) data structure, which reduces audit bandwidth and improves update costs by utilizing local storage on the client, allowing for efficient data updates and retrievability with minimal data impact.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a small change is made to prevent server misbehavior, then security is improved, but communication cost increases significantly
Solution Approach 1:
The system segments the outsourced data into multiple blocks and introduces a separate log structure to track updates. Instead of affecting the entire data structure with each update, changes are recorded in the log, allowing efficient verification without reprocessing all data blocks.
Solution Approach 2:
The system pre-computes and stores authentication tags for data blocks before updates occur. When updates happen, the pre-computed tags enable efficient verification without requiring the server to reprocess all data, reducing communication overhead while maintaining security.
2Productivity
If efficient update mechanisms are implemented, then update cost is reduced, but security against server misbehavior weakens
Solution Approach 1:
The log structure serves as an intermediary between the client and server for tracking updates. The log contains authentication information that verifies update validity without requiring the client to download and verify all data blocks, thus maintaining security while improving update efficiency.
Solution Approach 2:
The system performs partial verification by checking only the log structure and relevant authentication tags rather than verifying all data blocks. This partial action approach maintains sufficient security guarantees while significantly reducing update costs.
3Productivity
If the client stores more local data, then update efficiency improves, but client storage requirement increases
Solution Approach 1:
The system extracts the authentication verification functionality from the main data storage and places it in a separate, compact log structure. This allows the client to store minimal verification data locally while maintaining efficient update capabilities.
Solution Approach 2:
The system separates verification data from the main data storage by introducing a temporal dimension through the log structure. Updates are recorded chronologically in the log, allowing efficient verification without storing all historical data blocks locally.
Data Source
AI summary
The present invention relates to a data storage and retrieval system. The system includes a at least one client device; and at least one-server. The server includes at least one memory, a processor and a log store. The client data is divided into different blocks and stored in the server. Different logs are generated for each block and stored in the log store. The storage in the server are audited for ensuring their integrity. The present invention also relates to a method used to store and retrieve data form the above system. The present invention also relates to a method used to initialize empty buffers in a storage of a system.