Optimally efficient multi-valued byzantine agreement
From MaRDI portal
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) (n)-person games, (n>2) (91A06) Noncooperative games (91A10) Information theory (general) (94A15) Cryptography (94A60)
Recommendations
- scientific article; zbMATH DE number 7774268
- Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
- Round-optimal Byzantine agreement
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Message-optimal protocols for Byzantine Agreement
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- scientific article; zbMATH DE number 7774289
- scientific article; zbMATH DE number 4121395
Cited in
(41)- Modular construction of a Byzantine agreement protocol with optimal message bit complexity
- On the message complexity of binary Byzantine agreement under crash failures
- Information-theoretic broadcast with dishonest majority for long messages
- Round-optimal Byzantine agreement
- Performance study of Byzantine agreement protocol with artificial neural network
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Optimal extension protocols for Byzantine broadcast and agreement
- Communication complexity of Byzantine agreement, revisited
- Linear overhead optimally-resilient robust MPC using preprocessing
- Recent results on fault-tolerant consensus in message-passing networks
- Secure computation, I/O-efficient algorithms and distributed signatures
- Multi-valued Byzantine broadcast: the \(t < n\) case
- Error-free multi-valued consensus with Byzantine failures
- Broadcast (and round) efficient verifiable secret sharing
- Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
- Efficient Byzantine Agreement with Faulty Minority
- Communication optimal multi-valued asynchronous broadcast protocol
- Message-optimal protocols for Byzantine Agreement
- Communication Complexity of Byzantine Agreement, Revisited
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
- Brief announcement: communication efficient asynchronous Byzantine agreement
- Euro-Par 2004 Parallel Processing
- On Optimal Probabilistic Asynchronous Byzantine Agreement
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Optimal communication complexity of authenticated Byzantine agreement
- scientific article; zbMATH DE number 7774289 (Why is no real title available?)
- Efficient adaptively-secure Byzantine agreement for long messages
- Improved extension protocols for Byzantine broadcast and agreement
- Scalable and secure computation among strangers: message-competitive Byzantine protocols
- Brief announcement: Byzantine agreement, broadcast and state machine replication with optimal good-case latency
- Asymptotically optimal message dissemination with applications to blockchains
- Closing the efficiency gap between synchronous and network-agnostic consensus
- Sublinear message bounds of authenticated implicit Byzantine agreement
- Scalable agreement protocols with optimal optimistic efficiency
- Brief announcement: Communication-optimal convex agreement
- Byzantine agreement and Byzantine broadcast
- Synchronous distributed key generation without broadcasts
- Multidimensional agreement in Byzantine systems
This page was built for publication: Optimally efficient multi-valued byzantine agreement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177277)
