Kevin D. Bowers
Ronald L. Rivest
ABSTRACT
This paper presents a new challenge--verifying that a remote server is storing a file in a fault-tolerant manner, i.e., such that it can survive hard-drive failures. We describe an approach called the Remote Assessment of Fault Tolerance (RAFT). The key technique in a RAFT is to measure the time taken for a server to respond to a read request for a collection of file blocks. The larger the number of hard drives across which a file is distributed, the faster the read-request response. Erasure codes also play an important role in our solution. We describe a theoretical framework for RAFTs and offer experimental evidence that RAFTs can work in practice in several settings of interest.
- D. G. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan. FAWN: A fast array of wimpy nodes. In Proc. ACM SOSP, 2009. Google Scholar
Digital Library
- G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song. Provable data possession at untrusted stores. In Proc. ACM CCS, pages 598--609, 2007. Google ScholarDigital Library
- M. Bellare and P. Rogaway. The exact security of digital signatures: How to sign with RSA and Rabin. In U. Maurer, editor, Proc. EUROCRYPT '96, volume 1070 of LNCS, pages 399--416. Springer-Verlag, 1989. Google ScholarDigital Library
- K. Bowers, A. Juels, and A. Oprea. HAIL: A high-availability and integrity layer for cloud storage. In Proc. ACM CCS '09, pages 187--198, 2009. Google ScholarDigital Library
- K. D. Bowers, M. van Dijk, A. Juels, A Oprea, and R. Rivest. How to tell if your cloud files are vulnerable to drive crashes, 2010. IACR ePrint manuscript 2010/214.Google Scholar
- S. Brands and D. Chaum. Distance-bounding protocols (extended abstract). In Proc. EUROCRYPT '93, pages 344--359. Springer, 1993. LNCS vol. 765. Google ScholarDigital Library
- A. Clements, I. Ahmad, M. Vilayannur, and J. Li. Decentralized deduplication in san cluster file systems. In Proc. USENIX Annula Technical Conference, 2009. Google ScholarDigital Library
- J. Cox. T-Mobile, Microsoft tell Sidekick users we 'continue to do all we can' to restore data. Network World, October 13, 2009.Google Scholar
- R. Curtmola, O. Khan, R. Burns, and G. Ateniese. MR.PDP: Multiple-replica provable data possession. In Proc. 28th IEEE ICDCS, 2008. Google ScholarDigital Library
- Y. Dodis, S. Vadhan, and D. Wichs. Proofs of retrievability via hardness amplification. In Proc. TCC, 2009. Google ScholarDigital Library
- C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In E.F. Brickell, editor, Proc. CRYPTO '92, pages 139--147. Springer, 1992. LNCS vol. 740. Google ScholarDigital Library
- A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Proc. CRYPTO'86, volume 263 of LNCS, pages 186--194. Springer, 1986. Google ScholarDigital Library
- T. Garfinkel, B. Pfaff, J. Chow, M. Rosenblum, and D. Boneh. Terra: a virtual machine-based platform for trusted computing. In Proc. ACM SOSP, pages 193--206, 2003. Google ScholarDigital Library
- S. Ghemawat, H. Gobioff, and S.T. Leung. The Google file system. In Proc. ACM SOSP, pages 29--43, 2003. Google ScholarDigital Library
- P. Golle, S. Jarecki, and I. Mironov. Cryptographic primitives enforcing communication and storage complexity. In Proc. Financial Cryptography, pages 120--135. Springer, 2002. LNCS vol. 2357. Google ScholarDigital Library
- P. Gopalan, R. J. Lipton, and Y. Z. Ding. Error correction against computationally bounded adversaries, October 2004. Manuscript.Google Scholar
- The Hadoop distributed file system. http://hadoop.apache.org/hdfs.Google Scholar
- S. Halevi and P. Rogaway. A tweakable enciphering mode. In D. Boneh, editor, Proc. CRYPTO'03, volume 2729 of LNCS, pages 482--499. Springer, 2003.Google Scholar
- Mozy CTO J. Herlocker. Personal Communication, 2011.Google Scholar
- A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proc. ISOC NDSS, pages 151--165, 1999.Google Scholar
- A. Juels and B. Kaliski. PORs--proofs of retrievability for large files. In Proc. ACM CCS 2007, pages 584--597, 2007. Google ScholarDigital Library
- J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. STOC, pages 80--86, 2000. Google ScholarDigital Library
- R. Kotla, L. Alvisi, and M. Dahlin. Safestore: a durable and practical storage system. In Proc. USENIX'07, pages 10:1--10:14, Berkeley, CA, USA, 2007. USENIX Association. Google ScholarDigital Library
- C. Lumezanu, R. Baden, N. Spring, and B. Bhattacharjee. Triangle inequality variations in the internet. In Proc. ACM IMC, 2009. Google ScholarDigital Library
- R. Merkle. A certified digital signature. In Proc. Crypto 1989, volume 435 of LNCS, pages 218--238. Springer-Verlag, 1989. Google ScholarDigital Library
- J.F. Muth and G.L. Thompson. Industrial scheduling. Prentice-Hall, 1963.Google Scholar
- M. Naor and G. N. Rothblum. The complexity of online memory checking. In Proc. 46th IEEE FOCS, pages 573--584, 2005. Google ScholarDigital Library
- J. Ousterhout, P. Agrawal, D. Erickson, C. Kozyrakis, J. Leverich, D. Mazières, S. Mitra, A. Narayanan, G. Parulkar, M. Rosenblum, S. M. Rumble, E. Stratmann, and R. Stutsman. The case for RAMClouds: Scalable high-performance storage entirely in dram. SIGOPS Operating Systems Review, 43(4):92--105, 2009. Google ScholarDigital Library
- E. Riedel, C. Van Ingen, and J. Gray. A performance study of sequential I/O on Windows NT 4.0. Technical Report MSR-TR-97--34, Microsoft Research, September 1997.Google Scholar
- C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):17--29, 1994. Google ScholarDigital Library
- H. Shacham and B. Waters. Compact proofs of retrievability. In Proc. Asiacrypt 2008, volume 5350 of LNCS, pages 90--107. Springer-Verlag, 2008. Google ScholarDigital Library
- B. L. Worthington, G. R. Ganger, and Y. N. Patt. Scheduling algorithms for modern disk drives. In Proc. ACM Sigmetrics, pages 241--251, 1994. Google ScholarDigital Library
Index Terms
- How to tell if your cloud files are vulnerable to drive crashes
Recommendations
RACS: a case for cloud storage diversity
SoCC '10: Proceedings of the 1st ACM symposium on Cloud computingThe increasing popularity of cloud storage is leading organizations to consider moving data out of their own data centers and into the cloud. However, success for cloud storage providers can present a significant risk to customers; namely, it becomes ...
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
PODC '17: Proceedings of the ACM Symposium on Principles of Distributed ComputingMotivated by emerging applications to the edge computing paradigm, we introduce a two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for read and write operations. In edge computing, clients interact with an edge-...
An optimized approach for storing and accessing small files on cloud storage
Hadoop distributed file system (HDFS) is widely adopted to support Internet services. Unfortunately, native HDFS does not perform well for large numbers but small size files, which has attracted significant attention. This paper firstly analyzes and ...
Comments