TY - GEN
T1 - ByzID
T2 - 33rd IEEE International Symposium on Reliable Distributed Systems, SRDS 2014
AU - Duan, Sisi
AU - Levitt, Karl
AU - Meling, Hein
AU - Peisert, Sean
AU - Zhang, Haibin
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014
Y1 - 2014
N2 - Building robust network services that can withstand a wide range of failure types is a fundamental problem in distributed systems. The most general approach, called Byzantine fault tolerance, can mask arbitrary failures. Yet it is often considered too costly to deploy in practice, and many solutions are not resilient to performance attacks. To address this concern we leverage two key technologies already widely deployed in cloud computing infrastructures: replicated state machines and intrusion detection systems. First, we have designed a general framework for constructing Byzantine failure detectors based on an intrusion detection system. Based on such a failure detector, we have designed and built a practical Byzantine fault-tolerant protocol, which has costs comparable to crash-resilient protocols like Paxos. More importantly, our protocol is particularly robust against several key attacks such as flooding attacks, timing attacks, and fairness attacks, that are typically not handled well by Byzantine fault masking procedures.
AB - Building robust network services that can withstand a wide range of failure types is a fundamental problem in distributed systems. The most general approach, called Byzantine fault tolerance, can mask arbitrary failures. Yet it is often considered too costly to deploy in practice, and many solutions are not resilient to performance attacks. To address this concern we leverage two key technologies already widely deployed in cloud computing infrastructures: replicated state machines and intrusion detection systems. First, we have designed a general framework for constructing Byzantine failure detectors based on an intrusion detection system. Based on such a failure detector, we have designed and built a practical Byzantine fault-tolerant protocol, which has costs comparable to crash-resilient protocols like Paxos. More importantly, our protocol is particularly robust against several key attacks such as flooding attacks, timing attacks, and fairness attacks, that are typically not handled well by Byzantine fault masking procedures.
UR - http://www.scopus.com/inward/record.url?scp=84938908382&partnerID=8YFLogxK
U2 - 10.1109/SRDS.2014.28
DO - 10.1109/SRDS.2014.28
M3 - Conference contribution
AN - SCOPUS:84938908382
T3 - Proceedings of the IEEE Symposium on Reliable Distributed Systems
SP - 253
EP - 264
BT - Proceedings - 2014 IEEE 33rd International Symposium on Reliable Distributed Systems, SRDS 2014
PB - IEEE Computer Society
Y2 - 6 October 2014 through 9 October 2014
ER -