TY - JOUR
T1 - Proofs of Physical Reliability for Cloud Storage Systems
AU - Li, Li
AU - Lazos, Loukas
N1 - Funding Information:
The authors thank the anonymous reviewers for their insightful comments. This research was supported in part by the US National Science Foundation under grant CNS1813401. Any opinions, findings, conclusions, or recommendations expressed in this article are those of the author(s) and do not necessarily reflect the views of the US National Science Foundation.
Publisher Copyright:
© 1990-2012 IEEE.
PY - 2020/5/1
Y1 - 2020/5/1
N2 - Cloud service providers (CSPs) promise to reliably store repositories outsourced by clients. Unfortunately, once files have left the client's control, he has no means to verify their redundant storage. In this article, we develop Proof of Physical Reliability (PoPR) auditing mechanisms that prove that a CSP stores an outsourced repository across multiple physical storage nodes. A PoPR complements the existing proof-of-retrievability (PoR) and proof-of-data possession (PDP) methods that are concerned with file retrievability, but without any verification of the fault-tolerance to physical storage nodes failures. A PoPR goes beyond retrievability by verifying that a file is redundantly stored across multiple physical storage nodes according to a pre-agreed layout and can, therefore, survive node failures. The verification mechanism relies on a combination of storage integrity and timing tests on the simultaneous retrieval of a collection of file symbols from multiple storage nodes. Compared to the state-of-the-art, our approach accommodates CSPs with heterogeneous storage devices (hard disks, SSDs, etc.) and does not assume constant data processing nor network delays. Instead, it can operate under any delay variance, because it relies only on (loose) delay bounds. We analytically prove the security of our construction and experimentally validate its success in heterogeneous storage settings.
AB - Cloud service providers (CSPs) promise to reliably store repositories outsourced by clients. Unfortunately, once files have left the client's control, he has no means to verify their redundant storage. In this article, we develop Proof of Physical Reliability (PoPR) auditing mechanisms that prove that a CSP stores an outsourced repository across multiple physical storage nodes. A PoPR complements the existing proof-of-retrievability (PoR) and proof-of-data possession (PDP) methods that are concerned with file retrievability, but without any verification of the fault-tolerance to physical storage nodes failures. A PoPR goes beyond retrievability by verifying that a file is redundantly stored across multiple physical storage nodes according to a pre-agreed layout and can, therefore, survive node failures. The verification mechanism relies on a combination of storage integrity and timing tests on the simultaneous retrieval of a collection of file symbols from multiple storage nodes. Compared to the state-of-the-art, our approach accommodates CSPs with heterogeneous storage devices (hard disks, SSDs, etc.) and does not assume constant data processing nor network delays. Instead, it can operate under any delay variance, because it relies only on (loose) delay bounds. We analytically prove the security of our construction and experimentally validate its success in heterogeneous storage settings.
KW - Proof of reliability
KW - data integrity
KW - data security and privacy
KW - fault tolerance
KW - retrievability
KW - storage reliability
UR - http://www.scopus.com/inward/record.url?scp=85078479533&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078479533&partnerID=8YFLogxK
U2 - 10.1109/TPDS.2019.2958919
DO - 10.1109/TPDS.2019.2958919
M3 - Article
AN - SCOPUS:85078479533
VL - 31
SP - 1048
EP - 1065
JO - IEEE Transactions on Parallel and Distributed Systems
JF - IEEE Transactions on Parallel and Distributed Systems
SN - 1045-9219
IS - 5
M1 - 8930269
ER -