Resilient-optimal interactive consistency in constant time

DOI10.1007/s00446-002-0083-3zbMath1448.68074OpenAlexW2023051771MaRDI QIDQ5138494

Michael Ben-Or, Ran El-Yaniv

Publication date: 4 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-002-0083-3

zbMATH Keywords

distributed systemsfault toleranceByzantine agreementbroadcast channelsinteractive consistency

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (11)

Optimal extension protocols for Byzantine broadcast and agreement ⋮ Secure multi-party computation in large networks ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ On the Validity of Consensus ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Asynchronous reference frame agreement in a quantum network ⋮ Multiparty generation of an RSA modulus ⋮ Broadcast-optimal two-round MPC

Cites Work

• Unnamed Item
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Security and composition of multiparty cryptographic protocols
• Reaching Agreement in the Presence of Faults
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Fast asynchronous Byzantine agreement with optimal resilience

This page was built for publication: Resilient-optimal interactive consistency in constant time