TY - JOUR
T1 - EPoSt: Practical and Client-Friendly Proof of Storage-Time
AU - Zhang, Chengru
AU - Li, Xinyu
AU - Au, Man Ho
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China under Grant 61972332, in part by the Innovation Technology Fund under Grant ITS/224/20FP, and in part by the Huawei Contract Research under Grant RS 210158.
Publisher Copyright:
© 2005-2012 IEEE.
PY - 2023/1
Y1 - 2023/1
N2 - Data availability is the major concern of outsourced data storage services. While reliability is promoted by many storage providers, it is infeasible for users to verify these claims. Proofs of Storage-Time are proposed to address this issue: They allow a prover to convince a verifier that the prover indeed stores the outsourced data continuously during the whole storage period. These protocols, however, either fail to guarantee the actual duration of data possession, or require the client to perform a computationally expensive storing process for each file, marking them far from being practical. We present ePoSt , the first secure, stateless and efficient Proof of Storage-Time protocol with public verifiability. Not only does it ensure continuous data availability, but it also minimizes the cost of the client, which is crucial for real-world deployment. Specifically, processing a 1GB file for outsourcing, in anticipation for 3 proof/verify interactions, each attesting a period of 1 year at 25 minutes intervals requires only 66.34 minutes. In contrast, state-of-The-Art solution requires 51 hours of processing to prepare a file for outsourcing. Proof size and verification remains at a reasonable cost: A proof is of size 48.82KB, and can be verified in 36.05 ms. Furthermore, our solution enjoys public verifiability and remains stateless. The former allows the data owner to outsource the verification process, and the latter allows unlimited number of proofs and verification to be conducted after the file has been stored. These properties make ePoSt particularly suitable for new business models such as decentralised storage networks (e.g., Filecoin).
AB - Data availability is the major concern of outsourced data storage services. While reliability is promoted by many storage providers, it is infeasible for users to verify these claims. Proofs of Storage-Time are proposed to address this issue: They allow a prover to convince a verifier that the prover indeed stores the outsourced data continuously during the whole storage period. These protocols, however, either fail to guarantee the actual duration of data possession, or require the client to perform a computationally expensive storing process for each file, marking them far from being practical. We present ePoSt , the first secure, stateless and efficient Proof of Storage-Time protocol with public verifiability. Not only does it ensure continuous data availability, but it also minimizes the cost of the client, which is crucial for real-world deployment. Specifically, processing a 1GB file for outsourcing, in anticipation for 3 proof/verify interactions, each attesting a period of 1 year at 25 minutes intervals requires only 66.34 minutes. In contrast, state-of-The-Art solution requires 51 hours of processing to prepare a file for outsourcing. Proof size and verification remains at a reasonable cost: A proof is of size 48.82KB, and can be verified in 36.05 ms. Furthermore, our solution enjoys public verifiability and remains stateless. The former allows the data owner to outsource the verification process, and the latter allows unlimited number of proofs and verification to be conducted after the file has been stored. These properties make ePoSt particularly suitable for new business models such as decentralised storage networks (e.g., Filecoin).
KW - continuous data availability
KW - Outsourced storage
KW - proof of storage
UR - http://www.scopus.com/inward/record.url?scp=85147231211&partnerID=8YFLogxK
U2 - 10.1109/TIFS.2022.3233780
DO - 10.1109/TIFS.2022.3233780
M3 - Journal article
AN - SCOPUS:85147231211
SN - 1556-6013
VL - 18
SP - 1052
EP - 1063
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
ER -