When you don't trust clients: Byzantine proposer fast Paxos

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2012, Pages 193-202

  Meling, Hein ^a   Marzullo, Keith ^b   Mei, Alessandro ^c  

^a UNIVERSITY OF STAVANGER   (Norway)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT REQUEST; CONSENSUS PROTOCOLS; FAULTY SERVERS; HYBRID FAILURE MODEL; LOW LATENCY; STATE MACHINE REPLICATION;

HARDWARE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84866887214     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2012.38     Document Type: Conference Paper

References (24)

1. A. S. Aiyer, L. Alvisi, R. A. Bazzi, and A. Clement. Matrix signatures: From macs to digital signatures in distributed systems. In Proceedings of the 22nd international symposium on Distributed Computing, DISC '08, pages 16-31, Berlin, Heidelberg, 2008. Springer-Verlag.
2. A. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.-P. Martin, and C. Porth. Bar fault tolerance for cooperative services. In Proceedings of the twentieth ACM symposium on Operating systems principles, SOSP '05, pages 45-58, New York, NY, USA, 2005. ACM.
3. Y. Amir, B. Coan, J. Kirsch, and J. Lane. Prime: Byzantine replication under attack. IEEE Trans. Dependable Secur. Comput., 8:564-577, July 2011.
4. M. Castro and B. Liskov. Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst., 20(4):398-461, 2002.
5. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43:685-722, July 1996.
6. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43:225-267, March 1996.
7. B.-G. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz. Attested append-only memory: making adversaries stick to their word. In Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, SOSP '07, pages 189-204, New York, NY, USA, 2007. ACM.
8. A. Clement, M. Kapritsos, S. Lee, Y. Wang, L. Alvisi, M. Dahlin, and T. Riche. Upright cluster services. In Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles, SOSP '09, pages 277-290, New York, NY, USA, 2009. ACM.
9. A. Clement, E. Wong, L. Alvisi, M. Dahlin, and M. Marchetti. Making byzantine fault tolerant systems tolerate byzantine faults. In Proceedings of the 6th USENIX symposium on Networked systems design and implementation, NSDI'09, pages 153-168, Berkeley, CA, USA, 2009. USENIX Association.
10. M. Correia, N. F. Neves, and P. Verissimo. How to tolerate half less one byzantine nodes in practical distributed systems. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, SRDS '04, pages 174-183, Washington, DC, USA, 2004. IEEE Computer Society.
11. R. Guerraoui, N. Knežević, V. Quéma, and M. Vukolić. The Next 700 BFT Protocols. In Proceedings of the 5th European conference on Computer systems, EuroSys '10, pages 363-376, New York, NY, USA, 2010. ACM.
12. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative byzantine fault tolerance. ACM Trans. Comput. Syst., 27:7:1-7:39, January 2010.
13. L. Lamport. The part-time parliment. ACM Trans. on Comp. Syst., 16(2):133-169, 1998.
14. L. Lamport. Paxos made simple. ACM SIGACT News, 32(4):18-25, December 2001.
15. L. Lamport. Fast paxos. Distributed Computing, 19(2):79-103, 2006.
16. L. Lamport, D. Malkhi, and L. Zhou. Reconfiguring a state machine. SIGACT News, 41:63-73, March 2010.
17. Y. Mao, F. Junqueira, and K. Marzullo. Towards low latency state machine replication for uncivil wide-area networks. In Fifth Workshop on Hot Topics in Dependable Systems (HotDep'09), Estoril, Lisbon, Portugal, June 2009.
18. J.-P. Martin and L. Alvisi. Fast byzantine consensus. IEEE Trans. Dependable Secur. Comput., 3(3):202-215, July 2006.
19. J.-P. E. Martin. Byzantine Fault-Tolerance and Beyond. PhD thesis, University of Texas, Austin, December 2006.
20. K. Marzullo, H. Meling, and A. Mei. Brief Announcement: When You Don't Trust Clients: Byzantine Proposer Fast Paxos. In Proceedings of the 25nd International Symposium on Distributed Computing, volume 6950 of DISC '11, pages 143-144, Rome, Italy, September 2011. Springer.
21. H. Meling, K. Marzullo, and A. Mei. When You Don't Trust Clients: Byzantine Proposer Fast Paxos. Technical report, University of California, March 2012.
22. B. Schneier. Applied cryptography (2nd ed.): protocols, algorithms, and source code in C. John Wiley & Sons, Inc., New York, NY, USA, 1995.
23. T. Wood, R. Singh, A. Venkataramani, P. Shenoy, and E. Cecchet. Zz and the art of practical bft execution. In Proceedings of the sixth conference on Computer systems, EuroSys '11, pages 123-138, New York, NY, USA, 2011. ACM.
24. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for byzantine fault tolerant services. In Proceedings of the nineteenth ACM symposium on Operating systems principles, SOSP '03, pages 253-267, New York, NY, USA, 2003. ACM.