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, it is discussed how three different applications can be realized using such an architecture: ...

Citations

1300	Impossibility of distributed consensus with one faulty process - Fischer, Lynch, et al. - 1985
1130	Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
807	Unreliable Failure Detectors for Reliable Distributed - Chandra, Toueg - 1996
716	Implementing fault-tolerant services using the state machine approach: a tutorial - Schneider - 1990
581	Kerberos: An authentication service for open network systems - Steiner, Neuman, et al. - 1988
579	Cryptography – Theory and Practice - Stinson - 2006
476	Practical Byzantine fault tolerance - Castro, Liskov - 1999
450	Reaching agreement in the presence of faults - Pease, Shostak, et al. - 1980
366	Byzantine quorum systems - Malkhi, Reiter - 1997
178	Another advantage of free choice: completely asynchronous agreement protocols - Ben-Or - 1983
173	Practical threshold signatures - Shoup - 2000
162	Secure agreement protocols: Reliable and atomic group multicast in Rampart - Reiter - 1994
132	Asynchronous consensus and broadcast protocols - Bracha, Toueg - 1985
122	Generalized secret sharing and monotone functions - Benaloh, Leichter - 1989
117	The SecureRing protocols for securing group communication - Kihlstrom, Moser, et al. - 1998
103	U.: General secure multi-party computation from any linear secret-sharing scheme - Cramer, Damg˚ard, et al. - 2000
94	Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro
89	Random oracles in constantinople: Practical asynchronous byzantine agreement using cryptography - Cachin, Kursawe, et al.
83	Threshold Cryptography - Desmedt - 1994
72	Intrusion tolerance in distributed computing systems - Deswarte, Blain, et al. - 1991
59	Player simulation and general adversary structures in perfect multiparty computation - Hirt, Maurer - 2000
59	Secure and efficient asynchronous broadcast protocols - Cachin, Kursawe, et al. - 2001
57	Fast asynchronous byzantine agreement with optimal resilience - Canetti, Rabin - 1993
53	Proactive security: Long-term protection against break-ins - Canetti, Gennaro, et al. - 1997
49	An Architecture for Survivable Coordination in Large Distributed Systems - Malkhi, Reiter - 2000
48	C.: Randomization in Byzantine agreement - Chor, Dwork - 1989
45	Optimistic Atomic Broadcast - Pedone, Schiper - 1998
43	Distributing trust with the Rampart toolkit - Reiter - 1996
41	How to securely replicate services - Reiter, Birman - 1994
38	Secure Distributed Storage and Retrieval - Garay, Gennaro, et al. - 1997
27	Distributed Pseudo-random Functions and KDCs - Naor, Pinkas, et al. - 1999
26	Why Chosen Ciphertext Security Matters - Shoup - 1998
24	Efficient byzantine agreement secure against general adversaries - Fitzi, Maurer - 1998
22	A continuum of failure models for distributed computing - Garay, Perry - 1992
16	Byzantine-resistant total ordering algorithms - Moser, Melliar-Smith - 1999
15	Optimistic asynchronous atomic broadcast - Kursawe, Shoup
13	From Crash-Fault Tolerance to Arbitrary-Fault Tolerance: Towards a Modular Approach - Baldoni, Helary, et al. - 2000
13	Consensus in asynchronous distributed systems: A concise guided tour - Guerraoui, Hurfin, et al. - 1999
11	Abstractions for devising byzantine-resilient state machine replication - Doudou, Guerraoui, et al. - 2000
11	The timely computing base: Timely actions in the presence of uncertain timeliness - Verssimo, Casimiro, et al. - 2000
8	Secure and ecient asynchronous broadcast protocols (extended abstract - Cachin, Kursawe, et al. - 2001
7	Secure reliable multicast protocols in a WAN - Malkhi, Merritt, et al. - 1997
5	editor. Specification of Dependable Trusted Third Parties - Cachin - 2001
4	Guest Ed.), \Group communication - Powell - 1996
1	Guest Ed.), "Group communication - Powell - 1996