Polynomial algorithms for multiple processor agreement

No abstract is available for this paper.

• Publication year

  1982

• Venue

  Symposium on the Theory of Computing

• Publication date

  1982-05-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/800070.802215
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Authenticated Algorithms for Byzantine Agreement

  1983cited by this paper
• The Byzantine Generals Problem

  1982cited by this paper
• A Lower Bound for the Time to Assure Interactive Consistency

  1982cited by this paper
• Unanimity in an unknown and unreliable environment

  1981cited by this paper
• The Byzantine Generals Strike Again

  1981cited by this paper
• Reaching Agreement in the Presence of Faults

  1980cited by this paper
• A method for obtaining digital signatures and public-key cryptosystems

  1978cited by this paper
• New Directions in Cryptography

  1976cited by this paper

• QDBFT: A Dynamic Consensus Algorithm for Quantum-Secured Blockchain

  2026cites this paper
• Byzantine Fault Tolerant Consensus in Open Wireless Networks via an Abstract MAC Layer

  2025cites this paper
• E-cclesia: Universally Composable Self-Tallying Elections over Anonymous Broadcast

  2025cites this paper
• Building a Theory of Distributed Systems: Work by Nancy Lynch and Collaborators

  2025cites this paper
• Robust and Scalable Renaming with Subquadratic Bits

  2025cites this paper
• Keynote: Time is not a Healer: Before and After

  2024cites this paper
• Asynchronous Consensus in Synchronous Systems Using send_to_all Primitive

  2023cites this paper
• FnF-BFT: A BFT Protocol with Provable Performance Under Attack

  2023cites this paper
• REACi-llNG APPROXIMATE AGREEMENT IN THE PRESENCE OF FAUL TS

  2023cites this paper
• Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications

  2023cites this paper
• STROBE: Streaming Threshold Random Beacons

  2023cites this paper
• End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening Liveness

  2023cites this paper
• CRAFT: Composable Randomness Beacons and Output-Independent Abort MPC From Time

  2023cites this paper
• Multi-pipeline HotStuff: A High Performance Consensus for Permissioned Blockchain

  2022cites this paper
• Modelling proof-of-work agreement protocol by coloured Petri nets

  2022cites this paper
• GearBox: Optimal-size Shard Committees by Leveraging the Safety-Liveness Dichotomy

  2022cites this paper
• Byzantine Fault Tolerance For Distributed Ledgers Revisited

  2022cites this paper
• STROBE: Stake-based Threshold Random Beacons

  2021cites this paper
• GearBox: An Efficient UC Sharded Ledger Leveraging the Safety-Liveness Dichotomy

  2021cites this paper
• The Adversary Capabilities In Practical Byzantine Fault Tolerance

  2021cites this paper
• Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems

  2021cites this paper
• A Byzantine Fault-Tolerant Consensus Library for Hyperledger Fabric

  2021cites this paper
• The Golden Snitch: A Byzantine Fault Tolerant Protocol with Activity

  2021cites this paper
• Sperax Blockchain: Secure BFT Consensus Protocol for Asynchronous Networks

  2020cites this paper
• Byzantine Fault Tolerance in Partial Synchronous Networks

  2020cites this paper
• FnF-BFT: Exploring Performance Limits of BFT Protocols

  2020cites this paper
• Round efficient computationally secure multi-party computation revisited

  2019cites this paper
• Reliable distributed information : agreement and structure

  2019cites this paper
• A Permit-Based Optimistic Byzantine Ledger

  2019cites this paper
• HotStuff: BFT Consensus with Linearity and Responsiveness

  2019cites this paper
• Another Look at Byzantine Fault Tolerance

  2019cites this paper
• Byzantine Fault Tolerance in Partially Connected Asynchronous Networks

  2019cites this paper
• HotStuff: BFT Consensus in the Lens of Blockchain

  2018cites this paper
• Impossibility of n-1-strong-equllibrium for Distributed Consensus with Rational Agents

  2017cites this paper
• Rational Consensus: Extended Abstract

  2016cites this paper
• Beyond One Third Byzantine Failures

  2015cites this paper
• Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity

  2015cites this paper
• Secure Multiparty Computation and Secret Sharing

  2015cites this paper
• Balls-into-leaves: sub-logarithmic renaming in synchronous message-passing systems

  2014cites this paper
• On the complexity of asynchronous agreement against powerful adversaries

  2013cites this paper
• Rational Protocol Design: Cryptography against Incentive-Driven Adversaries

  2013cites this paper
• Universally Composable Synchronous Computation

  2013cites this paper
• Efficient Construction of Global Time in SoCs Despite Arbitrary Faults

  2013cites this paper
• A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation

  2013cites this paper
• Problème du Consensus dans le Modèle Homonyme

  2013cites this paper
• Order-Preserving Renaming in Synchronous Systems with Byzantine Faults

  2012cites this paper
• Order-preserving Renaming in Synchronous Message Passing Systems with Byzantine Faults

  2012cites this paper
• Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

  2011cites this paper
• Synchronous consensus under hybrid process and link failures

  2011cites this paper
• The Weighted Byzantine Agreement Problem

  2011cites this paper
• Player-Centric Byzantine Agreement

  2011cites this paper
• The contest between simplicity and efficiency in asynchronous byzantine agreement

  2011cites this paper
• Graceful Degradation in Multi-Party Computation

  2011cites this paper
• Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation

  2010influential citation
• Structural failure models for fault-tolerant distributed computing

  2010cites this paper
• Generalized corruption models in secure multi-party computation

  2010cites this paper
• Fast Asynchronous Consensus with Optimal Resilience

  2010cites this paper
• Proactive obfuscation

  2010cites this paper
• Adaptively Secure Broadcast

  2010cites this paper
• Realistic Failures in Secure Multi-party Computation

  2009cites this paper
• On the round complexity of Byzantine agreement without initial set-up

  2009cites this paper
• Tight Bounds for Protocols with Hybrid Security

  2009cites this paper
• The Heard-Of model: computing in distributed systems with benign faults

  2009cites this paper
• On the Number of Synchronous Rounds Required for Byzantine Agreement

  2008cites this paper
• Almost-Asynchronous MPC with Faulty Minority

  2008cites this paper
• Efficient Asynchronous Byzantine Agreement with Optimal Resilience

  2008cites this paper
• MPC vs. SFE: Perfect Security in a Unified Corruption Model

  2008cites this paper
• New Perspectives in Distributed Computing Invited Lecture

  2007cites this paper
• Agreement in synchronous networks with ubiquitous faults

  2007cites this paper
• Robust and private computations of mobile agent alliances

  2007cites this paper
• Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links

  2007cites this paper
• Distributed systems of simple interacting agents

  2007cites this paper
• Robustness of distributed systems inspired by biological processes (חוסן של מערכות מבוזרות בהשראת תהליכים ביולוגיים.)

  2006cites this paper
• Stabilizing Consensus in Mobile Networks

  2006cites this paper
• Secure Multi-party Computation from Weak Primitives

  2006cites this paper
• Design and analysis of distributed algorithms

  2006cites this paper
• Self-stabilizing byzantine agreement

  2006cites this paper
• 1 Unconditionally Secure Multi-party Computation from Weak Primitives

  2006cites this paper
• Efficient Multi-party Computation with Dispute Control

  2006cites this paper
• Byzantine Agreement Given Partial Broadcast

  2005cites this paper
• Multiparty Computation, an Introduction

  2005cites this paper
• Majority and Unanimity in Synchronous Networks with Ubiquitous Dynamic Faults

  2005cites this paper
• Broadcast and secure computation under reduced setup assumptions

  2005cites this paper
• Uniform consensus is harder than consensus

  2004influential citation
• Reliable synchronization in distributed systems

  2004cites this paper
• Multi-party Computation with Hybrid Security

  2004cites this paper
• Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

  2004cites this paper
• Fault tolerance in collaborative sensor networks for target detection

  2004cites this paper
• On Protocol Security in the Cryptographic Model

  2003cites this paper
• Two-Threshold Broadcast and Detectable Multi-party Computation

  2003cites this paper
• Linear Time Byzantine Self-Stabilizing Clock Synchronization

  2003cites this paper
• Using consensus for solving conflict situations in fault-tolerant distributed systems

  2001cites this paper
• A New Synchronous Lower Bound for Set Agreement

  2001cites this paper
• Mathematical Foundations of Computer Science 1999

  1999cites this paper
• New Perspectives in Distributed Computing

  1999cites this paper
• The unified structure of consensus: a layered analysis approach

  1998cites this paper
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds

  1998cites this paper
• A Distributed Election Protocol for Unreliable Networks

  1996cites this paper
• Distributed Algorithms

  1996cites this paper
• Optimal resiliency against mobile faults

  1995cites this paper