On Expected Constant-Round Protocols for Byzantine Agreement
From MaRDI portal
Publication:5756649
DOI10.1007/11818175_27zbMath1161.68322OpenAlexW1565004756WikidataQ64357330 ScholiaQ64357330MaRDI QIDQ5756649
Chiu-Yuen Koo, Jonathan N. Katz
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_27
Related Items (26)
On the round complexity of randomized Byzantine agreement ⋮ Invited talk: Resilient distributed algorithms ⋮ Instant block confirmation in the sleepy model ⋮ Proof-of-reputation blockchain with Nakamoto fallback ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Round-optimal Byzantine agreement ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Perfect MPC over layered graphs ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Efficient Simultaneous Broadcast ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ How Byzantine is a send corruption? ⋮ Broadcast-optimal two-round MPC
This page was built for publication: On Expected Constant-Round Protocols for Byzantine Agreement
