A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1

• URL: http://arxiv.org/abs/2410.23477v2
• Date: Thu, 07 Nov 2024 21:07:09 GMT
• Title: A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1
• Authors: Nasit S Sony, Xianzhong Ding, Mukesh Singhal,
• Abstract summary: Multi-valued Byzantine agreement protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. This paper presents a committee-based MVBA protocol (cMVBA) that achieves agreement without extra communication rounds by analyzing message patterns in asynchronous networks with probability 1.
• Score: 0.5120567378386615
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-valued Byzantine agreement (MVBA) protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. Despite advances, challenges persist in optimizing these protocols for communication and computation efficiency. This paper presents a committee-based MVBA protocol (cMVBA), a novel approach that achieves agreement without extra communication rounds by analyzing message patterns in asynchronous networks with probability 1.

Related papers

• Modeling and Performance Analysis for Semantic Communications Based on Empirical Results [53.805458017074294]
  We propose an Alpha-Beta-Gamma (ABG) formula to model the relationship between the end-to-end measurement and SNR. For image reconstruction tasks, the proposed ABG formula can well fit the commonly used DL networks, such as SCUNet, and Vision Transformer. To the best of our knowledge, this is the first theoretical expression between end-to-end performance metrics and SNR for semantic communications.
  arXiv  Detail & Related papers  (2025-04-29T06:07:50Z)
• Asynchronous BFT Consensus Made Wireless [17.041093019055555]
  Asynchronous Byzantine fault-tolerant (BFT) consensus protocols are becoming increasingly vital for wireless applications. While these protocols have proven effective in wired networks, their adaptation to wireless environments presents significant challenges. Asynchronous BFT consensus suffers from high message complexity, leading to network congestion and inefficiency.
  arXiv  Detail & Related papers  (2025-03-27T08:59:30Z)
• Communication-Efficient Federated Learning by Quantized Variance Reduction for Heterogeneous Wireless Edge Networks [55.467288506826755]
  Federated learning (FL) has been recognized as a viable solution for local-privacy-aware collaborative model training in wireless edge networks. Most existing communication-efficient FL algorithms fail to reduce the significant inter-device variance. We propose a novel communication-efficient FL algorithm, named FedQVR, which relies on a sophisticated variance-reduced scheme.
  arXiv  Detail & Related papers  (2025-01-20T04:26:21Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users [95.77678166036561]
  We propose a UCB-type algorithm with delicate communication protocols. We give sub-linear regret bounds on par with those achieved in the synchronous framework. Empirical evaluation on synthetic and real-world datasets validates our algorithm's superior performance in terms of regrets and communication costs.
  arXiv  Detail & Related papers  (2024-02-26T05:31:14Z)
• Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited [3.8014967401609208]
  We present the first information-theoretic multi-valued OCC protocol in the asynchronous setting with optimal resiliency. Our protocol efficiently implements with an exponential-size domain. We also provide proof in Canetti's Universal Composability framework.
  arXiv  Detail & Related papers  (2023-12-22T08:10:11Z)
• A Wireless AI-Generated Content (AIGC) Provisioning Framework Empowered by Semantic Communication [53.78269720999609]
  This paper proposes a semantic communication (SemCom)-empowered AIGC (SemAIGC) generation and transmission framework. Specifically, SemAIGC integrates diffusion models within the semantic encoder and decoder to design a workload-adjustable transceiver. Simulations verify the superiority of our proposed SemAIGC framework in terms of latency and content quality compared to conventional approaches.
  arXiv  Detail & Related papers  (2023-10-26T18:05:22Z)
• Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement [33.2699333323263]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. We present the results of implementing the protocol in a computer simulation based on the NetSquid framework.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Task-dependent semi-quantum secure communication in layered networks with OAM states of light [0.0]
  We present two protocols for secure communication in layered networks. First protocol allows sharing of two keys simultaneously in a network of two layers. Second protocol facilitates direct communication in one layer and key distribution in the other.
  arXiv  Detail & Related papers  (2023-06-20T17:57:00Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• 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)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Deterministic Entanglement Transmission on Series-Parallel Quantum Networks [2.86989372262348]
  This paper explores and amplifies a new and more effective mapping of QN, referred to as concurrence percolation theory (ConPT) We implement ConPT via a novel deterministic entanglement transmission scheme that is fully analogous to resistor network analysis. The DET is designed for general d-dimensional information carriers, scalable and adaptable for any series-parallel QN, and experimentally feasible as tested on IBM's quantum platform.
  arXiv  Detail & Related papers  (2021-10-11T03:29:03Z)
• Reinforcement learning-enhanced protocols for coherent population-transfer in three-level quantum systems [50.591267188664666]
  We deploy a combination of reinforcement learning-based approaches and more traditional optimization techniques to identify optimal protocols for population transfer. Our approach is able to explore the space of possible control protocols to reveal the existence of efficient protocols. The new protocols that we identify are robust against both energy losses and dephasing.
  arXiv  Detail & Related papers  (2021-09-02T14:17:30Z)

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.