Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
Daniel Collins, Yuval Efron, Jovan Komatovic

TL;DR
This paper introduces a crypto-agnostic Byzantine agreement protocol that maintains security without cryptographic assumptions, using a novel compiler to transform existing protocols with improved efficiency and fallback security.
Contribution
It presents a compiler transforming resilience-optimal Byzantine protocols into crypto-agnostic ones, reducing bit complexity and preserving round and communication complexity.
Findings
Improves bit complexity by at least two factors of n.
Provides early stopping or expected constant rounds.
Offers fallback security for t_i ≤ n/4.
Abstract
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, the overwhelming majority of protocols in the literature have the caveat that their security crucially hinges on the security of the cryptography and setup, to the point where if the cryptography is broken, even a single corrupted party can violate the security of the protocol. Thus these protocols provide higher corruption resilience ( instead of ) for the price of increased assumptions. Is this trade-off necessary? We further the study of crypto-agnostic Byzantine agreement among parties that answers this question in the negative. Specifically, let and denote two parameters such that (1) , and (2) . Crypto-agnostic Byzantine agreement ensures…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Cryptographic Implementations and Security · Advanced Authentication Protocols Security
