(Enter summary)
Abstract: This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each
storage-node. Such versioning enables the protocol to efficiently provide linearizability and wait-freedom of read and write operations
to erasure-coded data in asynchronous environments with Byzantine failures of clients and servers. By exploiting versioning
storage-nodes, the protocol shifts most work to clients and allows highly optimistic operation: reads occur in ... (Update)
Cited by: More
Ursa Minor: versatile cluster-based storage - Michael Abd-El-Malek William
(Correct)
Stardust: Tracking Activity in a Distributed Storage.. - Michael Abd-El-Malek..
(Correct)
Informed Data Distribution Selection in a - Self-Predicting Storage System
(Correct)
Similar documents (at the sentence level):
5.4%: Efficient Byzantine-tolerant erasure-coded storage - Garth Goodson Jay (2003)
(Correct)
Active bibliography (related documents): More All
1.4: Byzantine-Tolerant Erasure-Coded Storage - Garth Goodson Jay
(Correct)
1.3: A Protocol Family for Versatile Survivable Storage.. - Goodson, Wylie.. (2003)
(Correct)
1.3: A Protocol Family for Versatile Survivable Storage - Infrastructures Garth Goodson
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
13: Linearizability: A correctness condition for concurrent objects (context) - Herlihy, Wing - 1992
11: Efficient dispersal of information for security (context) - Rabin - 1989
11: Survivable information storage systems
- Wylie, Bigrigg et al. - 2000
BibTeX entry: (Update)
G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant erasure-coded storage. Technical report CMU-PDL-03-104. CMU, December 2003. http://citeseer.ist.psu.edu/article/goodson03efficient.html More
@misc{ goodson03efficient,
author = "G. Goodson and J. Wylie and G. Ganger and M. Reiter",
title = "Efficient Byzantine-tolerant erasure-coded storage",
text = "G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient Byzantine-tolerant
erasure-coded storage. Technical report CMU-PDL-03-104. CMU, December 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/goodson03efficient.html" }
Citations (may not include all citations):
739
Impossibility of distributed consensus with one faulty proce.. (context) - Fischer, Lynch et al. - 1985
645
How to share a secret (context) - Shamir - 1979
449
OceanStore: an architecture for global-scale persistent stor..
- Kubiatowicz, Bindel et al. - 2000
326
Linearizability: a correctness condition for concurrent obje.. (context) - Herlihy, Wing - 1990
214
Consensus in the presence of partial synchrony
- Dwork, Lynch et al. - 1988
189
Keying hash functions for message authentication
- Bellare, Canetti et al. - 1996
163
Efficient dispersal of information for security (context) - Rabin - 1989
144
Atomic broadcast: from simple message diffusion to Byzantine..
- Cristian, Aghili et al. - 1995
133
A practical scheme for non-interactive verifiable secret sha.. (context) - Feldman - 1987
120
ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
89
Implementing fault-tolerant services using the state machine.. (context) - Schneider - 1990
85
and reliable storage for an incompletely trusted environment (context) - Adya, Bolosky et al. - 2002
63
Kerberos: an authentication service for open network systems (context) - Steiner, Schiller et al. - 1988
57
Self-securing storage: protecting data in compromised system..
- Strunk, Goodson et al. - 2000
49
The load and availability of byzantine quorum systems
- Malkhi, Reiter et al. - 1906
48
How to make replicated data secure
- Herlihy, Tygar - 1987
46
Fault-tolerant wait-free shared objects
- Jayanti, Chandra et al. - 1998
46
Survivable information storage systems
- Wylie, Bigrigg et al. - 2000
39
How to securely replicate services (context) - Reiter, Birman - 1994
26
Practical Byzantine fault tolerance and proactive recovery (context) - Castro, Liskov - 2002
24
Metadata efficiency in versioning file systems
- Soules, Goodson et al. - 2003
23
Advances in Cryptology - CRYPTO (context) - Krawczyk, made - 1993
21
Reliable scheduling in a TMR database system (context) - Pittelli, Garcia-Molina - 1989
20
Storage: brick-based storage with automated administration (context) - Ganger, Strunk et al. - 2003
20
Securely replicating authentication services (context) - Gong - 1989
19
Persistent objects in the Fleet system
- Malkhi, Reiter et al. - 2001
19
A continuum of failure models for distributed computing
- Garay, Perry - 1992
18
Scale and performance in a distributed file system (context) - Howard, Kazar et al. - 1988
18
International Symposium on Distributed Computing (context) - Martin, Alvisi et al. - 2002
17
Secure and efficient asynchronous broadcast protocols
- Cachin, Kursawe et al. - 2001
16
ACM Transactions on Programming Languages (context) - Herlihy - 1991
16
Principal features of the voltan family of reliable node arc.. (context) - Shrivastava, Ezhilchelvan et al. - 1992
16
ACM Transactions on Information and Systems Security (context) - Kihlstrom, Moser et al. - 2001
14
Storage-based intrusion detection: watching storage activity..
- Pennington, Strunk et al. - 2003
12
Integrating security with fault-tolerant distributed databas.. (context) - Agrawal, Abbadi - 1990
11
FAB: enterprise storage systems on a shoestring
- Frolund, Merchant et al. - 2003
10
Self-adjusting quorum systems for byzantine fault tolerance
- Pierce - 2001
9
Storage: from atoms to people (context) - Morris - 2002
9
First International Workshop on Peer-to-Peer Systems (context) - Weatherspoon, Kubiatowicz et al. - 2002
9
and recovery with self-securing storage (context) - Strunk, Goodson et al. - 2002
9
Symposium on Operating Systems Design and Implementation (context) - Castro, Liskov et al. - 1999
8
ACM Symposium on Operating System Principles (context) - Baker, Hartman et al. - 1991
7
Storage efficient and secure replicated distributed database.. (context) - Mukkamala - 1994
6
An emperical study of a highly available file system (context) - Noble, Satyanarayanan - 1994
4
ACM Symposium on Theory of Computing (context) - Malkhi, Reiter et al. - 1997
4
IEEE Symposium on Reliable Distributed Networks (context) - Malkhi, Reiter et al. - 1998
4
Byzantine fault tolerance can be fast (context) - Castro, Liskov - 2001
4
Verifiable Secret Sharing in the Presence of Faults (context) - Chor, Goldwasser et al. - 1985
http://www.pmg.lcs.mit.edu/bft/#sw
http://www.ietf.org/rfc/rfc1321.txt
http://cryptopp.sourceforge.net/docs/ref/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.hpl.hp.com/personal/Jay_Wylie/publications/): More
A Protocol Family for Versatile Survivable Storage - Infrastructures Garth Goodson
(Correct)
Fault-Scalable Byzantine Fault-Tolerant Services - Michael Abd-El-Malek Gregory
(Correct)
Byzantine-Tolerant Erasure-Coded Storage - Garth Goodson Jay
(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