A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
A communication-efficient canonical form for fault-tolerant distributed protocols
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Asymptotically optimal algorithms for approximate agreement
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Fault tolerance in networks of bounded degree
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Byzantine clock synchronization
ACM SIGOPS Operating Systems Review
A message-based fault diagnosis procedure
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Chickens and eggs—the interrelationship of systems and theory
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the reliability of consensus-based fault-tolerant distributed computing systems
ACM Transactions on Computer Systems (TOCS)
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Asynchronous approximate agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
A Distributed Algorithm for Fault Diagnosis in Systems with Soft Failures
IEEE Transactions on Computers
A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability
IEEE Transactions on Software Engineering
Reliable scheduling in a TMR database system
ACM Transactions on Computer Systems (TOCS)
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fault tolerant distributed services
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Simple constant-time consensus protocols in realistic failure models
Journal of the ACM (JACM)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A categorical approach to distributed systems expressibility and knowledge
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Modular construction of nearly optimal Byzantine agreement protocols
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
A universal problem in secure and verifiable distributed computation
CRYPTO '88 Proceedings on Advances in cryptology
A characterization of eventual Byzantine agreement
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computing with unreliable information
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
How to withstand mobile virus attacks (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Consensus in the presence of timing uncertainty: omission and Byzantine failures (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Message-optimal protocols for byzantine agreement (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Formal verification of algorithms for critical systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
The Canadian Traveller Problem
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
A model-theoretic analysis of knowledge
Journal of the ACM (JACM)
An annotated bibliography of dependable distributed computing
ACM SIGOPS Operating Systems Review
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Fault tolerance: synchronization of redundancy
ACM SIGOPS Operating Systems Review
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
A lesson on authentication protocol design
ACM SIGOPS Operating Systems Review
Global, unpredictable bit generation without broadcast
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Time-adaptive algorithms for synchronization
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Robust sharing of secrets when the dealer is honest or cheating
Journal of the ACM (JACM)
Asynchronous secure computations with optimal resilience (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Uniform actions in asynchronous distributed systems
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Dynamic fault-tolerant clock synchronization
Journal of the ACM (JACM)
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Byzantine Agreement in a Generalized Connected Network
IEEE Transactions on Parallel and Distributed Systems
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVS
IEEE Transactions on Software Engineering
Bounds on information exchange for Byzantine agreement
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Using formal methods to reduce risks
Communications of the ACM
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
ACM SIGOPS Operating Systems Review
Comparing Verification Systems: Interactive Consistency in ACL2
IEEE Transactions on Software Engineering
Commodity-based cryptography (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Maintaining authenticated communication in the presence of break-ins
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Formally Verified On-Line Diagnosis
IEEE Transactions on Software Engineering
Byzantine Agreement in the Presence of Mixed Faults on Processors and Links
IEEE Transactions on Parallel and Distributed Systems
Optimal efficiency of optimistic contract signing
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Unifying synchronous and asynchronous message-passing models
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
On k-set consensus problems in asynchronous systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the 1998 workshop on New security paradigms
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Fast distributed agreement (preliminary version)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Simple constant-time consensus protocols in realistic failure models (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
A formal model of knowledge, action, and communication in distributed systems: preliminary report
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms
IEEE Transactions on Software Engineering
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Stability of long-lived consensus (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
Tight bounds for k-set agreement
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
A key distribution protocol using event markers
ACM Transactions on Computer Systems (TOCS)
Byzantine generals in action: implementing fail-stop processors
ACM Transactions on Computer Systems (TOCS)
On k-Set Consensus Problems in Asynchronous Systems
IEEE Transactions on Parallel and Distributed Systems
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
BASE: using abstraction to improve fault tolerance
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Synchronization as a framework for distributed system fault-tolerance design
EW 5 Proceedings of the 5th workshop on ACM SIGOPS European workshop: Models and paradigms for distributed systems structuring
On the composition of authenticated byzantine agreement
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Detectable byzantine agreement secure against faulty majorities
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Asynchronous interactive consistency and its relation with error-correcting codes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Early stopping in global data computation
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Asynchronous verifiable secret sharing and proactive cryptosystems
Proceedings of the 9th ACM conference on Computer and communications security
Is byzantine agreement useful in a distributed database?
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
IEEE Transactions on Knowledge and Data Engineering
Optimal Agreement Protocol in Malicious Faulty Processors and Faulty Links
IEEE Transactions on Knowledge and Data Engineering
Consensus With Dual Failure Modes
IEEE Transactions on Parallel and Distributed Systems
Reaching Approximate Agreement with Mixed-Mode Faults
IEEE Transactions on Parallel and Distributed Systems
Formal Verification of Algorithms for Critical Systems
IEEE Transactions on Software Engineering
The customizable fault/error model for dependable distributed systems
Theoretical Computer Science - Dependable computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Enhancements to the Voting Algorithm
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Abuse-Free Multi-party Contract Signing
Proceedings of the 13th International Symposium on Distributed Computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Complexity of Synchronous Iterative Do-All with Crashes
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A New Synchronous Lower Bound for Set Agreement
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Ruminations on Domain-Based Reliable Broadcast
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Secure Computation without Agreement
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Optimal Approximate Agreement with Omission Faults
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Community Formation via a Distributed, Privacy-Protecting Matchmaking System
Community Computing and Support Systems, Social Interaction in Networked Communities [the book is based on the Kyoto Meeting on Social Interaction and Communityware, held in Kyoto, Japan, in June 1998]
A Protocol for Loosely Time-Triggered Architectures
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Minimal Complete Primitives for Secure Multi-party Computation
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On 2-Round Secure Multiparty Computation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Bus Architectures for Safety-Critical Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Threshold and Bounded-Delay Voting in Critical Control Systems
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient Secure Multi-party Computation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Study of Failure Models in Feedback Control Systems
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Distributing Trust on the Internet
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Avoiding Malicious Byzantine Faults by a New Signature Generation Technique
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Robust Distributed Multiplicaton with out Interaction
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A multiple bus broadcast protocol resilient to non-cooperative Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Reconfiguration and transient recovery in state machine architectures
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Distributed allocation with pools of servers
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Finding safe paths in a faulty environment
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Bounds on information exchange for Byzantine Agreement
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The failure and recovery problem for replicated databases
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Elections in the presence of faults
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Patterns of communication in consensus protocols
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the possibility and impossibility of achieving clock synchronization
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Real-time dependable decisions in timed asynchronous distributed systems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Farsite: federated, available, and reliable storage for an incompletely trusted environment
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
ACM SIGOPS Operating Systems Review
Synchronous Consensus for Dependent Process Failures
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Distributed algorithm engineering
Experimental algorithmics
BASE: Using abstraction to improve fault tolerance
ACM Transactions on Computer Systems (TOCS)
Distributed consensus in the presence of sectional faults
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fault Tolerance in Safety Critical Automotive Applications: Cost of Agreement as a Limiting Factor
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Optimal Resiliency Against Mobile Faults
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Interactive Consistency Algorithms Based on Voting and Error-Correcting Codes
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Asynchronous consensus protocol for the unreliable un-fully connected network
ACM SIGOPS Operating Systems Review
Stability of long-lived consensus
Journal of Computer and System Sciences
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
IEEE Transactions on Parallel and Distributed Systems
Consensus in byzantine asynchronous systems
Journal of Discrete Algorithms
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Appraising two decades of distributed computing theory research
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Fault Tolerance in Collaborative Sensor Networks for Target Detection
IEEE Transactions on Computers
A flexible formal framework for masking/demasking faults
Information Sciences—Informatics and Computer Science: An International Journal
Future Generation Computer Systems - Special issue: Modeling and simulation in supercomputing and telecommunications
Merging paradigms of survivability and security: stochastic faults and designed faults
Proceedings of the 2003 workshop on New security paradigms
Dual link fault diagnosis agreement
Journal of Systems and Software
Collaboration of untrusting peers with changing interests
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Uniform consensus is harder than consensus
Journal of Algorithms
Revisiting fault diagnosis agreement in a new territory
ACM SIGOPS Operating Systems Review
On the Implementation of Unreliable Failure Detectors in Partially Synchronous Systems
IEEE Transactions on Computers
Optimal early stopping uniform consensus in synchronous systems with process omission failures
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Recent SRI work in verification
ACM SIGSOFT Software Engineering Notes
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Characterizing distributed systems using knowledge-based models: preliminary version
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
Using knowledge to optimally achieve coordination in distributed systems: extended abstract
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
Knowledge and common knowledge in a byzantine environment I: crash failures
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
The logic of distributed protocols: preliminary report
TARK '86 Proceedings of the 1986 conference on Theoretical aspects of reasoning about knowledge
A sound and complete algorithm for distributed commerce transactions
Distributed Computing
Distributed system diagnosis of byzantine failures in partially connected multicomputer systems
Automation and Remote Control
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems
IEEE Transactions on Dependable and Secure Computing
Farsite: federated, available, and reliable storage for an incompletely trusted environment
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Fast quantum byzantine agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Intrusion-Tolerant Server Architecture for Survivable Services
The Journal of Supercomputing
Resilient-optimal interactive consistency in constant time
Distributed Computing
Eventually consistent failure detectors
Journal of Parallel and Distributed Computing
Common knowledge and consistent simultaneous coordination
Distributed Computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Simultaneous broadcast revisited
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Reliable broadcast in unknown fixed-identity networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The bounds of faulty components on consensus with dual failure modes
ACM SIGOPS Operating Systems Review
Low-cost clock synchronization
Distributed Computing
Fast consensus in networks of bounded degree
Distributed Computing
Necessary and sufficient conditions for broadcast consensus protocols
Distributed Computing
Efficient agreement using fault diagnosis
Distributed Computing
Distributed Computing
Optimal time Byzantine agreement for t n/8 with linear-messages
Distributed Computing
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
Streets of consensus under unknown unreliable network
ACM SIGOPS Operating Systems Review
Implementing Trustworthy Services Using Replicated State Machines
IEEE Security and Privacy
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
Automation and Remote Control
ACM SIGSOFT Software Engineering Notes
EURASIP Journal on Wireless Communications and Networking
Byzantine agreement in the full-information model in O(log n) rounds
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Consensus on transaction commit
ACM Transactions on Database Systems (TODS)
Optimal decision strategies in Byzantine environments
Journal of Parallel and Distributed Computing
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Self-stabilizing byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the message complexity of binary byzantine agreement under crash failures
Distributed Computing
Efficient parallel algorithms can be made robust
Distributed Computing
A self-adjusting algorithm for byzantine agreement
Distributed Computing
Three architectures for trusted data dissemination in edge computing
Data & Knowledge Engineering - Special issue: ER 2004
A distributed host-based worm detection system
Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense
Coordinated data aggregation in wireless sensor networks using the Omega failure detector
Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks
Orchestrating fair exchanges between mutually distrustful web services
Proceedings of the 3rd ACM workshop on Secure web services
On the composition of authenticated Byzantine Agreement
Journal of the ACM (JACM)
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Eventually Dual Failure Agreement
Fundamenta Informaticae
Managed Agreement: Generalizing two fundamental distributed agreement problems
Information Processing Letters
Optimal resilient threshold GQ signatures
Information Sciences: an International Journal
The perfectly synchronized round-based model of distributed computing
Information and Computation
On the Respective Power of ◊P and ◊S to Solve One-Shot Agreement Problems
IEEE Transactions on Parallel and Distributed Systems
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Efficient fork-linearizable access to untrusted shared memory
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Tolerating corrupted communication
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Performance study of Byzantine Agreement Protocol with artificial neural network
Information Sciences: an International Journal
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
PeerReview: practical accountability for distributed systems
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Formal Specification and Mechanical Verification of SIFT: A Fault-Tolerant Flight Control System
IEEE Transactions on Computers
Distributed Reconfiguration Strategies for Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Two Designs of a Fault-Tolerant Clocking System
IEEE Transactions on Computers
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Complete fairness in secure two-party computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Distributed computing in SOSP and OSDI
ACM SIGACT News
Zyzzyva: speculative Byzantine fault tolerance
Communications of the ACM - Remembering Jim Gray
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Universally Composable Multi-party Computation Using Tamper-Proof Hardware
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Round-Efficient Secure Computation in Point-to-Point Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Discussing Redundancy Issues in Intelligent Agent-Based Non-traditional Grids
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
How to Solve Consensus in the Smallest Window of Synchrony
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Continuous Consensus with Failures and Recoveries
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Dynamic hybrid fault models and the applications to wireless sensor networks (WSNs)
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Managing redundancy in CAN-based networks supporting N-Version Programming
Computer Standards & Interfaces
The anatomy study of server-initial agreement for general hierarchy wired/wireless networks
Computer Standards & Interfaces
Multicast survivability in hierarchical broadcast networks
WSEAS TRANSACTIONS on COMMUNICATIONS
LIDeA: a distributed lightweight intrusion detection architecture for sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Optimal message-driven implementations of omega with mute processes
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Implementing the Omega failure detector in the crash-recovery failure model
Journal of Computer and System Sciences
Fork sequential consistency is blocking
Information Processing Letters
Fault Tolerance in Distributed Mechanism Design
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improving fault-tolerant scheme for a time-sensitive autonomous local wireless sensor network
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Cooperative Intrusion Detection in Wireless Sensor Networks
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Data aggregation in partially connected networks
Computer Communications
Rapid almost-complete broadcasting in faulty networks
Theoretical Computer Science
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Fault-tolerate Multiparty Electronic Contract Signing Protocol
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Simple and efficient asynchronous byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast scalable deterministic consensus for crash failures
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: global consistency can be easier than point-to-point communication
Proceedings of the 28th ACM symposium on Principles of distributed computing
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Computer Standards & Interfaces
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces
Achieving high efficient agreement with malicious faulty nodes on a cloud computing environment
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Zyzzyva: Speculative Byzantine fault tolerance
ACM Transactions on Computer Systems (TOCS)
A simple and communication-efficient Omega algorithm in the crash-recovery model
Information Processing Letters
Computers and Electrical Engineering
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Enhanced Fault-Tolerance through Byzantine Failure Detection
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Abortable Fork-Linearizable Storage
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the Computational Power of Shared Objects
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Towards dual fallible agreement in a virtual subnet network
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Reaching reliable agreement on wireless mobile network
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Quick consensus through early disposal of faulty processes
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Reliability and availability analysis of self-stabilizing systems
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Rapid almost-complete broadcasting in faulty networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A fault-tolerant scheme for an autonomous local wireless sensor network
Computer Standards & Interfaces
A framework for Incorporating trust into formal systems development
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Universally-composable two-party computation in two rounds
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Secure protocols with asymmetric trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
The building blocks of consensus
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Continuous consensus with ambiguous failures
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
On optimal probabilistic asynchronous Byzantine agreement
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Fault tolerance in finite state machines using fusion
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Almost-everywhere secure computation
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Practical impact of group communication theory
Future directions in distributed computing
Future directions in distributed computing
Lower bounds for asynchronous consensus
Future directions in distributed computing
Modeling complexity in secure distributed computing
Future directions in distributed computing
Randomization can be a healer: consensus with dynamic omission failures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Optimum simultaneous consensus for general omissions is equivalent to an NP oracle
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: a leader-free byzantine consensus algorithm
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Towards secure spectrum decision
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
Automation and Remote Control
Continuous consensus with ambiguous failures
Theoretical Computer Science
Improving robustness in an autonomous local sensor network
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Brief announcement: communication efficient asynchronous byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The byzantine empire in the intercloud
ACM SIGACT News
Achieving efficient agreement within a dual-failure cloud-computing environment
Expert Systems with Applications: An International Journal
Distributed agreement with optimal communication complexity
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Improved fault tolerance and secure computation on sparse networks
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Communication optimal multi-valued asynchronous broadcast protocol
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
The computational structure of progress conditions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Implementing fault-tolerant services using state machines: beyond replication
DISC'10 Proceedings of the 24th international conference on Distributed computing
Increasing web service dependability through consensus voting
COMPSAC-W'05 Proceedings of the 29th annual international conference on Computer software and applications conference
Eventually consistent failure detectors
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Distributed and randomized enumeration
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
A strategyproof mechanism for scheduling divisible loads in bus networks without control processors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Communication-efficient and crash-quiescent Omega with unknown membership
Information Processing Letters
Authenticated broadcast with a partially compromised public-key infrastructure
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Communication-efficient failure detection and consensus in omission environments
Information Processing Letters
Using Paxos to build a scalable, consistent, and highly available datastore
Proceedings of the VLDB Endowment
Signature-free broadcast-based intrusion tolerance: never decide a Byzantine value
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
A faster P solution for the Byzantine agreement problem
CMC'10 Proceedings of the 11th international conference on Membrane computing
A necessary and sufficient synchrony condition for solving Byzantine consensus in symmetric networks
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptively secure broadcast, revisited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Accurate byzantine agreement with feedback
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing
Fault Reporting in Partially Known Networks and Folk Theorems
Operations Research
Communication optimal multi-valued asynchronous byzantine agreement with optimal resilience
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Secure message transmission by public discussion: a brief survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
On communication complexity of secure message transmission in directed networks
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
On composability of reliable unicast and broadcast
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Authenticated Byzantine generals in dual failure model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Incentivizing responsible networking via introduction-based routing
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Player-centric Byzantine agreement
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Consensus vs. broadcast in communication networks with arbitrary mobile omission faults
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Communication-efficient leader election in crash-recovery systems
Journal of Systems and Software
Privacy-preserving DNS: analysis of broadcast, range queries and mix-based protection methods
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
The robustness of stability under link and node failures
Theoretical Computer Science
Brief announcement: leaderless byzantine paxos
DISC'11 Proceedings of the 25th international conference on Distributed computing
The contest between simplicity and efficiency in asynchronous byzantine agreement
DISC'11 Proceedings of the 25th international conference on Distributed computing
Byzantine agreement using partial authentication
DISC'11 Proceedings of the 25th international conference on Distributed computing
Fast Access to Distributed Atomic Memory
SIAM Journal on Computing
A topological condition for solving fair exchange in byzantine environments
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Brief announcement: communication-optimal implementation of failure detector class ⋄P
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Efficiency of dynamic arbitration in TDMA protocols
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
TrustedPals: secure multiparty computation implemented with smart cards
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
Optimal randomized fair exchange with secret shared coins
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Universally composable simultaneous broadcast
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
No double discount: Condition-based simultaneity yields limited gain
Information and Computation
State machine replication with byzantine faults
Replication
Verifiable agreement: limits of non-repudiation in mobile peer-to-peer ad hoc networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Beyond nash equilibrium: solution concepts for the 21st century
GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Self-stabilising protocols on oriented chains with joins and leaves
International Journal of Autonomous and Adaptive Communications Systems
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Fused state machines for fault tolerance in distributed systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Wireless sensor replica detection in mobile environments
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Low complexity resilient consensus in networked multi-agent systems with adversaries
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Journal of Network and Computer Applications
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the (limited) power of non-equivocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Byzantine broadcast in point-to-point networks using local linear coding
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Edge fault tolerance on sparse networks
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Byzantine agreement with a rational adversary
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Verifiable secret sharing in a total of three rounds
Information Processing Letters
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Homonyms with forgeable identifiers
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Eventually Dual Failure Agreement
Fundamenta Informaticae
Programming model support for dependable, elastic cloud applications
HotDep'12 Proceedings of the Eighth USENIX conference on Hot Topics in System Dependability
On the message complexity of indulgent consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Long live continuous consensus
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On the implementation of communication-optimal failure detectors
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
All-to-All gradecast using coding with byzantine failures
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Augustus: scalable and robust storage for cloud applications
Proceedings of the 8th ACM European Conference on Computer Systems
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the complexity of asynchronous agreement against powerful adversaries
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: pareto optimal solutions to consensus and set consensus
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Cooperative security in distributed networks
Computer Communications
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science
Towards Byzantine fault tolerant publish/subscribe: a state machine approach
Proceedings of the 9th Workshop on Hot Topics in Dependable Systems
On the complexity of broadcast setup
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Clone wars: Distributed detection of clone attacks in mobile WSNs
Journal of Computer and System Sciences
Authenticated broadcast with a partially compromised public-key infrastructure
Information and Computation
Journal of Computer and System Sciences
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
A simple Byzantine Generals protocol
Journal of Combinatorial Optimization
Scalable and leaderless Byzantine consensus in cloud computing environments
Information Systems Frontiers
Hi-index | 0.06 |
The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that allows each nonfaulty processor to infer a value for each other processor. The value inferred for a nonfaulty processor must be that processor's private value, and the value inferred for a faulty one must be consistent with the corresponding value inferred by each other nonfaulty processor.It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number. It is also shown that if faulty processors can refuse to pass on information but cannot falsely relay information, the problem is solvable for arbitrary n ≥ m ≥ 0. This weaker assumption can be approximated in practice using cryptographic methods.