Byzantine clients rendered harmless

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3724 LNCS, Issue , 2005, Pages 487-489

  Liskov, Barbara ^a   Rodrigues, Rodrigo ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646429467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_35     Document Type: Conference Paper

References (9)

1. R. Bazzi and Y. Ding. Non-skipping timestamps for byzantine data storage systems. In Distributed Computing, 18th International Conference, DISC2004, pages 405-419, Oct. 2004.
2. C. Cachin and S. Tessaro. Optimal resilience for erasure-coded byzantine distributed storage. Technical Report RZ 3575, IBM Research, Feb. 2005.
3. M. Castro and B. Liskov. Practical Byzantine Fault Tolerance. In Proc. 3rd OSDI, Feb. 1999.
4. G. Goodson, J. Wylie, G. Ganger, and M. Reiter. Efficient byzantine-tolerant erasure-coded storage. In Proc. of the International Conference on Dependable Systems and Networks, June 2004.
5. B. Liskov and R. Rodrigues. Byzantine clients rendered harmless. Technical Report MIT-LCS-TR-994 and INESC-ID TR-10-2005, July 2005.
6. D. Malkhi and M. Reiter. Byzantine Quorum Systems. Journal of Distributed Computing, 11(4):203-213, 1998.
7. D. Malkhi and M. Reiter. Secure and scalable replication in phalanx. In Proc. 17th SRDS, Oct. 1998.
8. D. Malkhi, M. Reiter, and N. Lynch. A Correctness Condition for Memory Shared by Byzantine Processes. Unpublished manuscript, Sept. 1998.
9. J. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. Technical Report TR-02-38, University of Texas at Austin, Department of Computer Sciences, Aug. 2002.