scientific article; zbMATH DE number 4121395

zbMATH Open0684.68018MaRDI QIDQ4734747FDOQ4734747

Authors: Paul Feldman, Silvio Micali 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Fast Byzantine agreement
• scientific article; zbMATH DE number 176512
• Asynchronous byzantine agreement protocols
• Random oracles in constantipole

zbMATH Keywords

networkfault toleranceprotocoldistributed computationCrusader Agreement protocolgrade verifiable secret sharinggraded broadcast

Mathematics Subject Classification ID

Stochastic programming (90C15) Theory of software (68N99) Theory of operating systems (68N25)

Cited In (23)

• Order-fairness for Byzantine consensus
• ADAPTIVE AND DOUBLY-EXPEDITED ONE-STEP CONSENSUS IN BYZANTINE ASYNCHRONOUS SYSTEMS
• Flipping Persuasively in Constant Time
• On the round complexity of fully secure solitary MPC with honest majority
• Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
• Message-optimal protocols for Byzantine Agreement
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Optimistically tuning synchronous Byzantine consensus: another win for null messages
• On the message complexity of binary Byzantine agreement under crash failures
• A characterization of eventual Byzantine agreement
• Asymptotically free broadcast in constant expected time via packed VSS
• Instant block confirmation in the sleepy model
• Optimally efficient multi-valued byzantine agreement
• Optimal extension protocols for Byzantine broadcast and agreement
• Near-optimal self-stabilising counting and firing squads
• Title not available (Why is that?)
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• A new solution for the Byzantine agreement problem
• Title not available (Why is that?)
• Expected linear round synchronization: the missing link for linear Byzantine SMR
• Total ordering algorithms for asynchronous Byzantine systems
• THE PROPORTIONAL LOTTERY PROTOCOL IS STRONGLY β-PARTICIPATORY AND VNM-STRATEGY-PROOF

This page was built for publication:

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