Fast byzantine agreement
From MaRDI portal
Publication:5176082
DOI10.1145/2484239.2484243zbMath1323.68562OpenAlexW1987161563MaRDI QIDQ5176082
Florian Huc, Nicolas Braud-Santoni, Rachid Guerraoui
Publication date: 2 March 2015
Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/199107/files/p57-santoni.pdf
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items
Secure Multi-party Shuffling ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Secure multi-party computation in large networks ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Unnamed Item ⋮ Must the communication graph of MPC protocols be an expander? ⋮ From fairness to full security in multiparty computation ⋮ Sublinear-round Byzantine agreement under corrupt majority
