How to tell if your cloud files are vulnerable to drive crashes

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2011, Pages 501-514

  Bowers, Kevin D ^a   Van Dijk, Marten ^a   Juels, Ari ^a   Oprea, Alina ^a   Rivest, Ronald L ^b  

^a RSA Laboratories   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Auditing; Cloud storage systems; Erasure codes; Fault tolerance

Indexed keywords

AUDITING; ERASURE CODES; EXPERIMENTAL EVIDENCE; FAULT-TOLERANT; HARD DRIVES; KEY TECHNIQUES; REMOTE ASSESSMENT; REMOTE SERVERS; THEORETICAL FRAMEWORK;

CLOUD COMPUTING; SECURITY OF DATA;

FAULT TOLERANCE;

EID: 80755144004     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2046707.2046766     Document Type: Conference Paper

References (32)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. S. Brands and D. Chaum. Distance-bounding protocols (extended abstract). In Proc. EUROCRYPT '93, pages 344-359. Springer, 1993. LNCS vol. 765.
7. A. Clements, I. Ahmad, M. Vilayannur, and J. Li. Decentralized deduplication in san cluster file systems. In Proc. USENIX Annula Technical Conference, 2009.
8. J. Cox. T-Mobile, Microsoft tell Sidekick users we 'continue to do all we can' to restore data. Network World, October 13, 2009.
9. R. Curtmola, O. Khan, R. Burns, and G. Ateniese. MR.PDP: Multiple-replica provable data possession. In Proc. 28th IEEE ICDCS, 2008.
10. Y. Dodis, S. Vadhan, and D. Wichs. Proofs of retrievability via hardness amplification. In Proc. TCC, 2009.
11. 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.
12. 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.
13. 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. (Pubitemid 40929697)
14. S. Ghemawat, H. Gobioff, and S.T. Leung. The Google file system. In Proc. ACM SOSP, pages 29-43, 2003. (Pubitemid 40929686)
15. 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. (Pubitemid 36316775)
16. P. Gopalan, R. J. Lipton, and Y. Z. Ding. Error correction against computationally bounded adversaries, October 2004. Manuscript.
17. The Hadoop distributed file system. http://hadoop.apache.org/hdfs.
18. 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. (Pubitemid 137636959)
19. Mozy CTO J. Herlocker. Personal Communication, 2011.
20. A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proc. ISOC NDSS, pages 151-165, 1999.
21. A. Juels and B. Kaliski. PORs-proofs of retrievability for large files. In Proc. ACM CCS 2007, pages 584-597, 2007.
22. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In Proc. STOC, pages 80-86, 2000.
23. 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.
24. C. Lumezanu, R. Baden, N. Spring, and B. Bhattacharjee. Triangle inequality variations in the internet. In Proc. ACM IMC, 2009.
25. R. Merkle. A certified digital signature. In Proc. Crypto 1989, volume 435 of LNCS, pages 218-238. Springer-Verlag, 1989.
26. J.F. Muth and G.L. Thompson. Industrial scheduling. Prentice-Hall, 1963.
27. M. Naor and G. N. Rothblum. The complexity of online memory checking. In Proc. 46th IEEE FOCS, pages 573-584, 2005.
28. 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.
29. 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.
30. C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27(3):17-29, 1994.
31. H. Shacham and B. Waters. Compact proofs of retrievability. In Proc. Asiacrypt 2008, volume 5350 of LNCS, pages 90-107. Springer-Verlag, 2008.
32. B. L. Worthington, G. R. Ganger, and Y. N. Patt. Scheduling algorithms for modern disk drives. In Proc. ACM Sigmetrics, pages 241-251, 1994.