New Lower Bound Solidifies Quadratic Communication Barrier for Byzantine Consensus
This research proves that even randomized Byzantine Agreement protocols require quadratic communication complexity against adaptive adversaries, fundamentally limiting consensus scalability.
Communication Lower Bounds Redefine Broadcast Efficiency in Dishonest-Majority Systems
New theoretical bounds and a sub-quadratic protocol fundamentally redefine the communication cost for Byzantine broadcast in dishonest-majority networks.
New Lower Bounds Define Communication Limits for Dishonest-Majority Broadcast Protocols
This research establishes fundamental communication lower bounds for randomized Byzantine broadcast in dishonest-majority networks, framing the ultimate scalability limits.
