Round-optimal Byzantine agreement without trusted setup

DOI10.1007/978-3-032-25324-8_15MaRDI QIDQ7299827zbMATH OpenFDO

Authors Diana Ghinea, Ivana Klasovita, Chen-Da Liu-Zhang

Publication date 20 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25324-8_15

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A lower bound for the time to assure interactive consistency
• A New Way to Achieve Round-Efficient Byzantine Agreement
• Algorand: a secure and efficient distributed ledger
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Authenticated Algorithms for Byzantine Agreement
• Born and raised distributively, fully distributed non-interactive adaptively-secure threshold signatures with short shares
• Breaking the O(√ n)-Bit Barrier
• Efficient player-optimal protocols for strong and differential consensus
• Expected constant round Byzantine broadcast under dishonest majority
• Fully polynomial Byzantine agreement in t + 1 rounds
• scientific article; zbMATH DE number 1304080 (Why is no real title available?)
• Lower bounds for randomized consensus under a weak adversary
• On Expected Constant-Round Protocols for Byzantine Agreement
• On the composition of authenticated Byzantine Agreement
• On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
• On the round complexity of randomized Byzantine agreement
• On the security of public key protocols
• Probabilistic Termination and Composability of Cryptographic Protocols
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Reaching Agreement in the Presence of Faults
• Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
• Round-optimal Byzantine agreement
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols
• Simple constant-time consensus protocols in realistic failure models
• Sublinear-round broadcast without trusted setup
• Sublinear-round Byzantine agreement under corrupt majority
• Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
• The Byzantine Generals Problem
• The round complexity of verifiable secret sharing and secure multicast
• Transparent batchable time-lock puzzles and applications to Byzantine consensus

This page was built for publication: Round-optimal Byzantine agreement without trusted setup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299827)