Low-overhead byzantine fault-tolerant storage

Operating Systems Review (ACM)

Volumn , Issue , 2007, Pages 73-86

  Hendricks, James ^a   Ganger, Gregory R ^a   Reiter, Michael K ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Byzantine fault tolerant storage

Indexed keywords

BLOCK STORAGE PROTOCOLS; BYZANTINE FAULT-TOLERANT STORAGE; CRYPTOGRAPHIC HASHES; HOMOMORPHIC FINGERPRINTS; BYZANTINE FAULT; CHECKSUM; FAULTY SERVERS; MULTIPLE FAULTS; WRITE OPERATIONS;

CLIENT SERVER COMPUTER SYSTEMS; CRYPTOGRAPHY; NETWORK PROTOCOLS; OPTIMIZATION; SERVERS; STORAGE ALLOCATION (COMPUTER); COMPUTER OPERATING SYSTEMS;

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS;

EID: 41149157927     PISSN: 01635980     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1294261.1294269     Document Type: Conference Paper

References (40)

1. th ACM Symposium on Operating Systems Principles, pages 59-74. ACM Press, 2005.
2. th IEEE Symposium on Reliable Distributed Systems, pages 179-190. IEEE Computer Society, 2005.
3. th USENIX Conference on File and Storage Technologies, pages 59-72. USENIX Association, 2005.
4. th ACM Symposium on Operating Systems Principles, pages 109-126. ACM Press, 1995.
5. th International Symposium on Distributed Computing, pages 405-419. Springer-Verlag, 2004.
6. st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, 1993.
7. J. Bonwick, M. Ahrens, V. Henson, M. Maybee, and M. Shellenbaum. The Zettabyte File System. Technical report, Sun Microsystems.
8. th IEEE Symposium on Reliable Distributed Systems, pages 191-202. IEEE Press, 2005.
9. C. Cachin and S. Tessaro. Optimal resilience for erasure-coded Byzantine distributed storage. In Proceedings of the International Conference on Dependable Systems and Networks, pages 115-124. IEEE Computer Society, 2006.
10. M. Castro and B. Liskov. Authenticated Byzantine fault tolerance without public-key cryptography. Technical Memo MIT-LCS-TM-589, MIT, June 1999.
11. P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Patterson. RAID: high-performance, reliable secondary storage. ACM Computing Surveys, 26(2): 145-185, 1994.
12. rd USENIX Conference on File and Storage Technologies, pages 1-14. USENIX Association, 2004.
13. th USENIX Symposium on Operating Systems Design and Implementation, pages 177-190. USENIX Association, 2006.
14. C. De Cannière and C. Rechberger. Finding SHA-I characteristics: General results and applications. In Advances in Cryptology- ASIACRYPT, pages 1-20. Springer-Verlag, 2006.
15. th ACM Symposium on Operating Systems Principles, pages 29-43. ACM Press, 2003.
16. B. Gladman. SHA1, SHA2, HMAC and key derivation in C. http://fp.gladman.plus.com/cryptography_technology/sha.
17. th International Conference on Distributed Computing Systems, pages 85-91. IEEE Computer Society, 1989.
18. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks, pages 135-144. IEEE Computer Society, 2004.
19. J. H. Hartman and J. K. Ousterhout. The Zebra striped network file system. ACM Transactions on Computer Systems, 13(3):274-310, 1995.
20. th ACM Symposium on Principles of Distributed Computing, pages 163-168. ACM Press, 2007.
21. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1): 124-149, 1991.
22. rd International Conference on Distributed Computing Systems, pages 522-529. IEEE Computer Society, 2003.
23. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
24. R. Kotla and M. Dahlin. High throughput byzantine fault tolerance. In Proceedings of the International Conference on Dependable Systems and Networks, pages 575-584. IEEE Computer Society, 2004.
25. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3): 382-401, 1982.
26. th International Conference on Distributed Computing Systems, pages 34-43. IEEE Computer Society, 2006.
27. J.-P. Martin, L. Alvisi, and M. Dahlin. Small Byzantine quorum systems. In Proceedings of the International Conference on Dependable Systems and Networks, pages 374-388. IEEE Computer Society, 2002.
28. N. Möller. Nettle Manual, 1.15 edition, 2006.
29. D. Nagle, D. Serenyi, and A. Matthews. The Panasas ActiveScale storage cluster: Delivering scalable high bandwidth storage. In Proceedings of the ACM/IEEE SC2004 Conference, page 53. IEEE Computer Society, 2004.
30. 2 Corporation, 2005.
31. M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335-348, 1989.
32. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. SIAM Journal of Applied Mathematics, 8:300-304, 1960.
33. rd Workshop on Hot Topics in System Dependability. USENIX Association, 2007.
34. th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 48-58. ACM Press, 2004.
35. nd USENIX Conference on File and Storage Technologies, pages 43-58. USENIX Association, 2003.
36. Sun Microsystems. ZFS On-Disk Specification Draft, 2006.
37. rd International Conference on Autonomic Computing, pages 187-198. IEEE Computer Society, 2006.
38. H. Weatherspoon and J. D. Kubiatowicz. Erasure coding vs. replication: a quantitative approach. In International Workshop on Peer-to-Peer Systems, pages 328-337. Springer-Verlag, 2002.
39. J. Wilkes, R. Golding, C. Staelin, and T. Sullivan. The HP AutoRAID hierarchical storage system. ACM Transactions on Computer Systems, 14(1): 108-136, 1996.
40. st International Conference on Autonomic Computing, pages 122-129. IEEE Computer Society, 2004.