scientific article; zbMATH DE number 4121395

zbMath0684.68018MaRDI QIDQ4734747

Silvio Micali, Paul Feldman

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

networkfault toleranceprotocoldistributed computationCrusader Agreement protocolgrade verifiable secret sharinggraded broadcast

Mathematics Subject Classification ID

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

Related Items (7)

Instant block confirmation in the sleepy model ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds ⋮ Message-optimal protocols for Byzantine Agreement ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ On the message complexity of binary Byzantine agreement under crash failures ⋮ Near-optimal self-stabilising counting and firing squads

This page was built for publication: