Liveness Checking of the HotStuff Protocol Family
- URL: http://arxiv.org/abs/2310.09006v1
- Date: Fri, 13 Oct 2023 11:03:13 GMT
- Title: Liveness Checking of the HotStuff Protocol Family
- Authors: J\'er\'emie Decouchant, Burcu Kulahcioglu Ozkan, Yanzhuo Zhou
- Abstract summary: Byzantine consensus protocols aim at maintaining safety guarantees under any network synchrony model.
Several protocols have been shown to violate liveness properties under certain scenarios.
We use temperature and lasso detection methods to check the liveness of Byzantine consensus protocols.
- Score: 2.07180164747172
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Byzantine consensus protocols aim at maintaining safety guarantees under any
network synchrony model and at providing liveness in partially or fully
synchronous networks. However, several Byzantine consensus protocols have been
shown to violate liveness properties under certain scenarios. Existing testing
methods for checking the liveness of consensus protocols check for time-bounded
liveness violations, which generate a large number of false positives. In this
work, for the first time, we check the liveness of Byzantine consensus
protocols using the temperature and lasso detection methods, which require the
definition of ad-hoc system state abstractions. We focus on the HotStuff
protocol family that has been recently developed for blockchain consensus. In
this family, the HotStuff protocol is both safe and live under the partial
synchrony assumption, while the 2-Phase Hotstuff and Sync HotStuff protocols
are known to violate liveness in subtle fault scenarios. We implemented our
liveness checking methods on top of the Twins automated unit test generator to
test the HotStuff protocol family. Our results indicate that our methods
successfully detect all known liveness violations and produce fewer false
positives than the traditional time-bounded liveness checks.
Related papers
- Accountable Liveness [11.004592479955189]
We study what analogous accountability guarantees are achievable for liveness.
We prove a precise characterization of the parameter regime in which accountable liveness is achievable.
arXiv Detail & Related papers (2025-04-16T16:13:09Z) - The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols.
Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol.
We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
arXiv Detail & Related papers (2024-07-16T20:53:04Z) - All graph state verification protocols are composably secure [1.534667887016089]
Graph state verification protocols allow multiple parties to share a graph state while checking that the state is honestly prepared, even in the presence of malicious parties.
Previous works conjectured that such a property could not be proven within the abstract cryptography framework.
We show that all graph state verification protocols can be turned into a composably secure protocol with respect to the natural functionality for graph state preparation.
arXiv Detail & Related papers (2024-02-02T14:37:26Z) - A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure.
This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus.
We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
arXiv Detail & Related papers (2024-01-19T14:52:04Z) - Short Paper: Accountable Safety Implies Finality [10.589723476970443]
Two key desiderata have been studied for Byzantine-fault tolerant (BFT) state-machine replication (SMR) consensus protocols.
We show that accountable safety implies finality, thereby unifying earlier results.
arXiv Detail & Related papers (2023-08-31T17:58:38Z) - Security of a Continuous-Variable based Quantum Position Verification
Protocol [0.0]
We present and analyze a protocol that utilizes coherent states and its properties.
We prove security of the protocol against any unentangled attackers via entropic uncertainty relations.
We show that attackers who pre-share one continuous-variable EPR pair can break the protocol.
arXiv Detail & Related papers (2023-08-08T09:56:38Z) - Robustness of implemented device-independent protocols against
constrained leakage [0.0]
Device-independent (DI) protocols have experienced significant progress in recent years.
Security proofs for those demonstrations rely on a typical assumption in DI cryptography, that the devices do not leak any unwanted information to each other or to an adversary.
arXiv Detail & Related papers (2023-02-27T16:28:23Z) - QuTE: decentralized multiple testing on sensor networks with false
discovery rate control [130.7122910646076]
This paper designs methods for decentralized multiple hypothesis testing on graphs equipped with provable guarantees on the false discovery rate (FDR)
We consider the setting where distinct agents reside on the nodes of an undirected graph, and each agent possesses p-values corresponding to one or more hypotheses local to its node.
Each agent must individually decide whether to reject one or more of its local hypotheses by only communicating with its neighbors, with the joint aim that the global FDR over the entire graph must be controlled at a predefined level.
arXiv Detail & Related papers (2022-10-09T19:48:39Z) - Byzantine-Robust Federated Learning with Optimal Statistical Rates and
Privacy Guarantees [123.0401978870009]
We propose Byzantine-robust federated learning protocols with nearly optimal statistical rates.
We benchmark against competing protocols and show the empirical superiority of the proposed protocols.
Our protocols with bucketing can be naturally combined with privacy-guaranteeing procedures to introduce security against a semi-honest server.
arXiv Detail & Related papers (2022-05-24T04:03:07Z) - Round-robin differential phase-time-shifting protocol for quantum key
distribution: theory and experiment [58.03659958248968]
Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties.
Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments.
We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario.
Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
arXiv Detail & Related papers (2021-03-15T15:20:09Z) - Entanglement purification by counting and locating errors with
entangling measurements [62.997667081978825]
We consider entanglement purification protocols for multiple copies of qubit states.
We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
arXiv Detail & Related papers (2020-11-13T19:02:33Z) - Composable Security for Multipartite Entanglement Verification [3.4806267677524896]
We present a composably secure protocol allowing $n$ parties to test an entanglement generation resource controlled by a possibly dishonest party.
The test consists only in local quantum operations and authenticated classical communication once a state is shared among them.
Our protocol can typically be used as a subroutine in a Quantum Internet, to securely share a GHZ state among the network before performing a communication or computation protocol.
arXiv Detail & Related papers (2020-04-16T14:33:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.