RAFR: remote assessment of file redundancy

Authors:
Sumanta Sarkar;Reihaneh Safavi-Naini;Liang Feng Zhang
Affiliations:
University of Calgary, Calgary, AB, Canada;University of Calgary, Calgary, AB, Canada;University of Calgary, Calgary, AB, Canada
Venue:
Proceedings of the 2013 international workshop on Security in cloud computing
Year:
2013

Citing 7
Cited 0

Pors: proofs of retrievability for large files

Proceedings of the 14th ACM conference on Computer and communications security
Provable data possession at untrusted stores

Proceedings of the 14th ACM conference on Computer and communications security
Compact Proofs of Retrievability

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proofs of Retrievability via Hardness Amplification

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
HAIL: a high-availability and integrity layer for cloud storage

Proceedings of the 16th ACM conference on Computer and communications security
Proofs of retrievability: theory and implementation

Proceedings of the 2009 ACM workshop on Cloud computing security
How to tell if your cloud files are vulnerable to drive crashes

Proceedings of the 18th ACM conference on Computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cloud storage services have been increasingly popular in recent years. To provide guarantee against possible drive failures and crashes, data must be stored with redundancy on multiple drives. In this paper, we propose Remote Assessment of File Redundancy (RAFR), with the goal of providing guarantee to users that the cloud has stored data in k + Ψ drives, for some Ψ n, k) MDS erasure code and stores it in n drives. The user can verify that at least k drives are holding the encoded data and so the data is recoverable. Our analysis shows that the value of Ψ is n -- k -- ω(log n).