From the 1 of 5 linked papers with an AI index.
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2026
Settling The Round Complexity of Byzantine Agreement Against a Full-Information, Adaptive Adversary
Yuval Efron
The paper establishes a new lower bound on the expected round complexity of randomized synchronous Byzantine Agreement protocols against a full‑information, strongly adaptive adver…
cs.DC2024
Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
Daniel Collins, Yuval Efron, Jovan Komatovic
It is well known that a trusted setup allows one to solve the Byzantine agreement problem in the presence of corruptions, bypassing the setup-free barrier. Alas, th…