There have been several reductions from multivalued consensus to binary consensus over the past 20 years. To the best of our knowledge, none of them solved it for Byzantine asynchronous settings. In this short paper, we close this gap. Moreover, we do so in subquadratic communication, using newly developed subquadratic binary Byzantine Agreement techniques.
@InProceedings{cohen_et_al:LIPIcs.DISC.2023.39, author = {Cohen, Shir and Keidar, Idit}, title = {{Brief Announcement: Subquadratic Multivalued Asynchronous Byzantine Agreement WHP}}, booktitle = {37th International Symposium on Distributed Computing (DISC 2023)}, pages = {39:1--39:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-301-0}, ISSN = {1868-8969}, year = {2023}, volume = {281}, editor = {Oshman, Rotem}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.39}, URN = {urn:nbn:de:0030-drops-191658}, doi = {10.4230/LIPIcs.DISC.2023.39}, annote = {Keywords: Byzantine agreement, subquadratic communication, fault tolerance in distributed systems} }
Feedback for Dagstuhl Publishing