(Enter summary)
Abstract: Adversary structures are a generalization of the classical "at most t-out-of-n" threshold failure model which is used in many published Byzantinetolerant protocols. An adversary structure basically lists all coalitions of parties whose corruption the protocol should tolerate. Using adversary structures it is possible to encode dependent failure models, such as "either all Linux machines fail or all Windows machines but not both at the same time". We describe a general technique that allows to... (Update)
Cited by: More
Replication Predicates for Dependent-Failure Algorithms - Flavio Junqueira And
(Correct)
Active bibliography (related documents): More All
3.6: Byzantine Fault Tolerance on General Hybrid Adversary Structures - Kursawe, Freiling (2005)
(Correct)
0.7: Byzantine Failures and Security: Arbitrary is not (always) Random - Gärtner, al. (2003)
(Correct)
0.4: Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003)
(Correct)
Similar documents based on text: More All
0.4: Revisiting Failure Detection and Consensus in.. - Delporte-Gallet.. (2005)
(Correct)
0.4: Code Stabilization - Freiling, Ghosh (2005)
(Correct)
0.2: An Offensive Approach to Teaching Information.. - Dornseif, Gärtner.. (2005)
(Correct)
BibTeX entry: (Update)
K. Kursawe and F. Freiling. Byzantine fault tolerance on general hybrid adversary structures. Technical Report AIB-2005-09, Aachen University, Aachen, Germany, Jan 2005. http://citeseer.ist.psu.edu/article/kursawe05byzantine.html More
@misc{ kursawe05byzantine,
author = "K. Kursawe and F. Freiling",
title = "Byzantine fault tolerance on general hybrid adversary structures",
text = "K. Kursawe and F. Freiling. Byzantine fault tolerance on general hybrid
adversary structures. Technical Report AIB-2005-09, Aachen University, Aachen,
Germany, Jan 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/article/kursawe05byzantine.html" }
Citations (may not include all citations):
739
Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
256
Reaching agreements in the presence of faults (context) - Pease, Shostak et al. - 1980
154
Secure multi-party computation
- Goldreich - 2002
141
Byzantine quorum systems
- Malkhi, Reiter - 1997
97
Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1985
95
Practical threshold signatures
- Shoup - 2000
93
Generalized secret sharing and monotone functions (context) - Benaloh, Leichter - 1988
91
Secret sharing scheme realizing general access structure (context) - Ito, Saito et al. - 1987
88
SIFT: Design and analysis of a fault-tolerant computer for a.. (context) - Wensley, Lamport et al. - 1978
67
Failure mode assumptions and assumption coverage
- Powell - 1992
55
IEEE Transactions on Software Engineering (context) - Reiter, group et al. - 1996
51
Random oracles in constantinople: Practical asynchronous Byz..
- Cachin, Kursawe et al. - 2000
39
Complete characterization of adversaries tolerable in secure..
- Hirt, Maurer - 1997
14
share a secret (context) - Simmons, really - 1988
11
cient asynchronous broadcast protocols (context) - Cachin, Kursawe et al. - 2001
8
Synchronous consensus for dependent process failures
- Junqueria, Marzullo - 2003
7
Byzantine fault-tolerant confidentiality
- Yin, Martin et al. - 2002
7
cient byzantine agreement secure against general adversaries (context) - Fitzi, Maurer - 1998
7
Asynchronous Byzantine group communication (context) - Kursawe - 2002
6
cient Byzantine-resilient reliable multicast on a hybrid fai.. (context) - Correia, Lung et al. - 2002
6
General adversaries in unconditional multi-party computation
- Fitzi, Hirt et al. - 1999
5
Reliability Engineering: Theory and Practice (context) - Birolini - 1999
4
A Byzantine resilient approach to network security (context) - Krings, McQueen - 1999
2
Byzantine failures and security: Arbitrary is not (context) - Gartner - 2003
2
Reliable broadcast in a computational hybrid model with byza.. (context) - Bakes, Cachin - 2002
2
University of Saarbrucken (context) - Kursawe, PhD - 2002
2
NASA's big push for the space station (context) - Oberg - 2000
Documents on the same site (http://lufgi4.informatik.rwth-aachen.de/publications-pdfs/): More
A Pointillist Approach for Comparing Honeypots - Pouget, Holz (2005)
(Correct)
Evaluating Advanced Routing Algorithms for.. - Mühl, Fiege.. (2002)
(Correct)
DREAM: Distributed Reliable Event-based Application.. - Buchmann, Bornhövd..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC