Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
How to securely replicate services
ACM Transactions on Programming Languages and Systems (TOPLAS)
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
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)
Communications of the ACM
Distributing trust with the Rampart toolkit
Communications of the ACM
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Byzantine-resistant total ordering algorithms
Information and Computation
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
A Continuum of Failure Models for Distributed Computing
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Efficient Byzantine Agreement Secure Against General Adversaries
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
From Crash Fault-Tolerance to Arbitrary-Fault Tolerance: Towards a Modular Approach
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
he Timely Computing Base: Timely Actions in the Presence of Uncertain Timeliness
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Abstractions for Devising Byzantine-Resilient State Machine Replication
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Secure reliable multicast protocols in a WAN
Distributed Computing
Distributed Computing
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
COCA: A secure distributed online certification authority
ACM Transactions on Computer Systems (TOCS)
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Security analysis of SITAR intrusion tolerance system
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
Byzantine fault tolerant public key authentication in peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
Automated adaptive intrusion containment in systems of interacting services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
Network Security: Know It All: Know It All
Network Security: Know It All: Know It All
Byzantine fault tolerant public key authentication in peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Management in peer-to-peer systems
The role of accountability in dependable distributed systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
SecureTorrent: a security framework for file swarming
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Parsimonious asynchronous byzantine-fault-tolerant atomic broadcast
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
CheapBFT: resource-efficient byzantine fault tolerance
Proceedings of the 7th ACM european conference on Computer Systems
Distributing trusted third parties
ACM SIGACT News
| Hi-index | 0.00 |
Abstract: This paper describes an architecture for secure and fault-tolerant service replication in an asynchronous network such as the Internet, where a malicious adversary may corrupt some servers and control the network. It relies on recent protocols for randomized Byzantine agreement and for atomic broadcast, which exploit concepts from threshold cryptography. The model and its assumptions are discussed in detail and compared to related work from the last decade in the first part of this work, and an overview of the broadcast protocols in the architecture is provided. The standard approach in fault-tolerant distributed systems is to assume that at most a certain fraction of servers fails. In the second part, novel general failure patterns and corresponding protocols are introduced. They allow for realistic modeling of real-world trust assumptions, beyond (weighted) threshold models. Finally, the application of our architecture to trusted services is discussed.