Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
From MaRDI portal
Publication:5197694
DOI10.1145/3212734.3212735zbMath1428.68058OpenAlexW2810136695MaRDI QIDQ5197694
Laasya Bangalore, Ashish Choudhury, Arpita Patra
Publication date: 19 September 2019
Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3212734.3212735
Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)
Related Items
Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation, Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time, Reaching consensus for asynchronous distributed key generation