Video Player

Practical Byzantine Fault Tolerance

Barbara Liskov: December 3, 2001; Running Time: 00:55:32

About the Lecture

About the Lecture

The increasing reliance of industry and government on online information services makes malicious attacks on these systems more and more attractive and the consequences of such attacks are very serious. This talk will describe a new replication technique that allows services to withstand such Byzantine failures; the system is not only resilient to malicious attacks, but it also can continue to operate correctly in the presence of software bugs.

The new algorithm is of interest for a number of reasons. It is the first approach that allows correct functioning over the lifetime of the system provided the number of Byzantine faults occurring in some small time window (e.g., 5 minutes) is bounded. It supports general applications and works in an asynchronous environment such as the Internet. It also includes a number of important optimizations that allow it to perform well in practice.

Lecture Details

Location: 34-101

About the Speaker

Barbara Liskov

Institute Professor, Department of Electrical Engineering and Computer Science and Computer Science and Artificial Intelligence Laboratory

Barbara Liskov has served at MIT since 1972. Previously, she worked at Mitre Corporation in computer science research and development. Liskov received her B.A. in mathematics from Stanford University, and her M.S. and Ph.D. from Stanford in computer science.

Liskov was named one of the 50 most important women in science by Discover Magazine. She is a member of the National Academy of Engineering, and the American Academy of Arts and Sciences. She won the 2008 Turing Award, and the IEEE 2004 John von Neumann Medal.