On the Optimality of Optimistic Responsiveness

Duke Privacy and Security Seminar
Speaker Name
Nibesh Shrestha
Date and Time
-
Location
Talk will be virtual on Zoom
Abstract

Synchronous consensus protocols, by definition, have a worst-case commit latency that depends on the bounded network delay. The notion of optimistic responsiveness was recently introduced to allow synchronous protocols to commit instantaneously when some optimistic conditions are met. In this work, we revisit this notion of optimistic responsiveness and present optimal latency results.

We present a lower bound for Byzantine Broadcast that relates the latencies of optimistic and synchronous commits when the designated sender is honest and while the optimistic commit can tolerate some faults. We then present two matching upper bounds for tolerating f faults out of n = 2f +1 parties. Our first upper bound result achieves optimal optimistic and synchronous commit latencies when the designated sender is honest and the optimistic commit can tolerate some faults. Our second upper bound result achieves optimal optimistic and synchronous commit latencies when the designated sender is honest but the optimistic commit does not tolerate any faults. The presence of matching lower and upper bound results make both of the results tight for n = 2f + 1. Our upper bound results are presented in a state machine replication setting with a steady state leader who is replaced with a view-change protocol when they do not make progress. For this setting, we also present an optimistically responsive protocol where the view-change protocol is optimistically responsive too.

Joint Work with Kartik Nayak, Ittai Abraham and Ling Ren

Short Biography

I am a fourth year PhD Student at Rochester Institute of Technology. I work under the supervision of Prof. Peizhao Hu (RIT) and Prof. Kartik Nayak (Duke) in the area of Distributed consensus and blockchains.

Host
Johes Bater