Paper 2026/1520
Quintus: Two-round Good-case Information Theoretic BFT for $n=5f+1$
Abstract
We present, Quintus, information-theoretic BFT protocols for tolerating $f < n/5$ Byzantine faults among $n$ parties. We present two protocols: (1) The first protocol, Quintus-Fixed, is in a fixed view regime where views advance at a cadence $3\Delta$ time. This protocol incurs a good-case latency of $2\delta$ time where $\delta$ indicates actual network delay and message complexity of $O(n^3)$ in a view. % In optimistic cases with good leaders, it incurs $O(n^2)$ message complexity. (2) The second protocol, Quintus-Responsive, is an optimistically responsive protocol with good-case latency of $2\delta$ time, $O(n^2)$ message complexity, and $2\Delta + 2\delta$ worst-case view latency where $\Delta$ denotes a pessimistic network delay parameter under synchrony.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Contact author(s)
-
chenyang liu @ duke edu
dahliamalkhi @ ucsb edu
kartik @ cs duke edu
nibeshrestha2 @ gmail com - History
- 2026-07-27: approved
- 2026-07-24: received
- See all versions
- Short URL
- https://ia.cr/2026/1520
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/1520,
author = {Chenyang Liu and Dahlia Malkhi and Kartik Nayak and Nibesh Shrestha},
title = {Quintus: Two-round Good-case Information Theoretic {BFT} for $n=5f+1$},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1520},
year = {2026},
url = {https://eprint.iacr.org/2026/1520}
}
