Optimally efficient multi-valued byzantine agreement
From MaRDI portal
Publication:5177277
DOI10.1145/1146381.1146407zbMath1314.68060OpenAlexW1978370567MaRDI QIDQ5177277
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1146381.1146407
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Cryptography (94A60) Information theory (general) (94A15) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (11)
Secure Computation, I/O-Efficient Algorithms and Distributed Signatures ⋮ Information-theoretic broadcast with dishonest majority for long messages ⋮ Performance study of Byzantine agreement protocol with artificial neural network ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ On Optimal Probabilistic Asynchronous Byzantine Agreement ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol
This page was built for publication: Optimally efficient multi-valued byzantine agreement
