Optimal resilience for erasure-coded byzantine distributed storage

Proceedings of the International Conference on Dependable Systems and Networks

Volumn 2006, Issue , 2006, Pages 115-124

  Cachin, Christian ^a   Tessaro, Stefano ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; CODES (SYMBOLS); COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; OPTIMIZATION; PROBLEM SOLVING;

ASYNCHRONOUS NETWORKS; BYZANTINE CLIENTS; BYZANTINE DISTRIBUTED STORAGE; WRITE REGISTERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33845562065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2006.56     Document Type: Conference Paper

References (25)

1. M. Abd-El-Malek, G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter, "Lazy verification in fault-tolerant distributed storage systems," in Proc. 24th Symposium on Reliable Distributed Systems (SRDS 2005), pp. 179-190, 2005.
2. M. K. Aguilera, R. Janakiraman, and L. Xu, "Using erasure codes efficiently for storage in a distributed system," in Proc. International Conference on Dependable Systems and Networks (DSN-2005), pp. 336-345, 2005.
3. N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. P. Stern, "Addendum to scalable secure storage when half the system is faulty." To appear in Information and Computation, available from http://research. microsoft.com/~dalia/,2004.
4. H. Attiya, A. Bar-Noy, and D. Dolev, "Sharing memory robustly in message-passing systems," Journal of the ACM, vol. 42, no. 1, pp. 124-142, 1995.
5. A. Azagury, V. Dreizin, M. Factor, E. Henis, D. Naor, N. Rinetzky, O. Rodeh, J. Satran, A. Tavory, and L. Yerushalmi, "Towards an object store," in Proc. IEEE/NASA Conference on Mass Storage Systems & Technologies (MSST 2003), pp. 165-177, 2003.
6. R. Bazzi and Y. Ding, "Non-skipping timestamps for Byzantine data storage systems," in Proc. 18th International Conference on Distributed Computing (DISC 2004), vol. 3274 of Lecture Notes in Computer Science, pp. 405-419, 2004.
7. R. E. Blahut, Theory and Practice of Error Control Codes. Reading: Addison-Wesley, 1983.
8. G. Bracha, "An asynchronous [(n - 1)/3]-resilient consensus protocol," in Proc. 3rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 154-162, 1984.
9. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup, "Secure and efficient asynchronous broadcast protocols (extended abstract)," in Advances in Cryptology: CRYPTO 2001, vol. 2139 of Lecture Notes in Computer Science, pp. 524-541, 2001.
10. C. Cachin and S. Tessaro, "Asynchronous verifiable information dispersal," in Proc. 24th Symp. on Reliable Distributed Systems (SRDS 2005), pp. 191-202, Oct. 2005.
11. C. Cachin and S. Tessaro, "Optimal resilience for erasure-coded Byzantine distributed storage," Research Report RZ 3575, IBM Research, Feb. 2005.
12. M. Castro and B. Liskov, "Practical Byzantine fault tolerance and proactive recovery," ACM Transactions on Computer Systems, vol. 20, pp. 398-461, Nov. 2002.
13. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, "Verifiable secret sharing and achieving simultaneity in the presence of faults," in Proc. 26th IEEE Symposium on Founda tions of Computer Science (FOCS), pp. 383-395, 1985.
14. S. Frølund, A. Merchant, Y. Saito, S. Spence, and A. Veitch, "A decentralized algorithm for erasure-coded virtual disks," in Proc. International Conference on Dependable Systems and Networks (DSN-2004), pp. 125-134, 2004.
15. J. A. Garay, R. Gennaro, C. Jutla, and T. Rabin, "Secure distributed storage and retrieval," Theoretical Computer Science, vol. 243, no. 1-2, pp. 363-389, 2000.
16. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter, "Efficient Byzantine-tolerant erasure-coded storage," in Proc. International Conference on Dependable Systems and Networks (DSN-2004), pp. 135-144, 2004.
17. V. Hadzilacos and S. Toueg, "Fault-tolerant broadcasts and related problems," in Distributed Systems (S. J. Mullender, ed.), ACM Press & Addison-Wesley, 1993.
18. H. Krawczyk, "Distributed fingerprints and secure information dispersal," in Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC), pp. 207-218, 1993.
19. L. Lamport, "On interprocess communication. Part ii: Algorithms," Distributed Computing, vol. 1, no. 2, pp. 86-101, 1986.
20. B. Liskov and R. Rodrigues, "Byzantine clients rendered harmless," in Proc. 19th International Conference on Distributed Computing (DISC 2005), vol. 3274 of Lecture Notes in Computer Science, pp. 487-489, 2005.
21. D. Malkhi and M. K. Reiter, "An architecture for survivable coordination in large distributed systems," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 2, pp. 187-202, 2000.
22. D. Malkhi, M. Reiter, and N. Lynch, "A correctness condition for memory shared by Byzantine processes." Manuscript, 1998.
23. J.-P. Martin, L. Alvisi, and M. Dahlin, "Minimal Byzantine storage," in Proc. 16th International Conference on Distributed Computing (DISC 2002), vol. 2508 of Lecture Notes in Computer Science, pp. 311-325, 2002.
24. M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance," Journal of the ACM, vol. 36, no. 2, pp. 335-348, 1989.
25. V. Shoup, "Practical threshold signatures," in Advances in Cryptology: EUROCRYPT 2000, vol. 1087 of Lecture Notes in Computer Science, pp. 207-220, 2000.