(Enter summary)
Abstract: This paper discusses how to use redundancy to simultaneously improve availability,
integrity, and confidentiality. We call this problem Confidential BFT (CBFT) and propose
the privacy firewall architecture to solve it. Service replicas connect to the privacy
firewall and can send messages to the outside world only through it. The firewall runs
a majority voting algorithm just like the clients of a traditional BFT system and filters
out faulty messages that may contain confidential data. This... (Update)
Cited by: More
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003)
(Correct)
Byzantine Fault Tolerance on General Hybrid Adversary Structures - Kursawe, Freiling (2005)
(Correct)
Similar documents (at the sentence level):
58.3%: Byzantine Fault-Tolerant Confidentiality - Yin, Venkataramani, Martin.. (2002)
(Correct)
Active bibliography (related documents): More All
0.0: Byzantine Disk Paxos: Optimal Resilience with.. - Abraham, Chockler.. (2004)
(Correct)
0.0: Intrusion-Tolerant Enclaves - Dutertre, Crettaz, Stavridou (2002)
(Correct)
0.0: URSA: Ubiquitous and Robust Access Control for Mobile.. - Luo, Kong, Zerfos, Lu, .. (2004)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
6: Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1985
6: ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
6: Byzantine quorum systems
- Malkhi, Reiter - 1997
BibTeX entry: (Update)
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., und Dahlin, M.: Byzantine faulttolerant confidentiality. In: Proc. Int. Workshop Future Directions in Distributed Computing. pp. 12--15. Jun. 2002. http://citeseer.ist.psu.edu/article/yin02byzantine.html More
@misc{ yin02byzantine,
author = "J. Yin and J. Martin and A. Venkataramani and L. Alvisi and M. und",
title = "Byzantine faulttolerant confidentiality",
text = "Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., und Dahlin, M.:
Byzantine faulttolerant confidentiality. In: Proc. Int. Workshop Future
Directions in Distributed Computing. pp. 12--15. Jun. 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/yin02byzantine.html" }
Citations (may not include all citations):
449
OceanStore: An architecture for global-scale persistent stor..
- Kubiatowicz, Bindel et al. - 2000
350
Implementing Fault-tolerant Services Using the State Machine..
- Schneider - 1990
235
Practical Byzantine fault tolerance
- Castro, Liskov - 1999
141
Byzantine quorum systems
- Malkhi, Reiter - 1998
97
Asynchronous consensus and broadcast protocols (context) - Bracha, Toueg - 1995
64
Robust and efficient sharing of RSA functions
- Gennaro, Rabin et al. - 2000
59
COCA: A secure distributed on-line certification authority
- Zhou, Schneider et al. - 2000
52
Intrusion tolerance in distributed computing systems
- Deswarte, Blain et al. - 1991
38
Building intrusion-tolerant applications
- Wu, Malkin et al. - 1999
28
Synchronous Byzantine quorum systems (context) - Bazzi - 1997
22
Secure hypergraphs: Privacy from partial broadcast
- Franklin, Yung - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/~jpmartin/papers/): More
Small Byzantine Quorum Systems - Martin, Alvisi, Dahlin (2001)
(Correct)
Separating Agreement from Execution for Byzantine.. - Yin, Martin.. (2003)
(Correct)
On Checking Temporal Properties of Software with Boolean Programs - Martin (2000)
(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