The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Farsite: federated, available, and reliable storage for an incompletely trusted environment
Abstract
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides file availability and reliability through randomized replicated storage; it ensures the secrecy of file contents with cryptographic techniques; it maintains the integrity of file and directory data with a Byzantine-fault-tolerant protocol; it is designed to be scalable by using a distributed hint mechanism and delegation certificates for pathname translations; and it achieves good performance by locally caching file data, lazily propagating file updates, and varying the duration and granularity of content leases. We report on the design of Farsite and the lessons we have learned by implementing much of that design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Self-citationPractical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Self-citationTransaction Processing: Concepts and Techniques
Gray, J., & Reuter, A. (1992) · Cited by 3,000
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
Cited by
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447
Cassandra: a decentralized structured storage system
Lakshman, A., & Malik, P. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1773912.1773922 · Cited by 2,664
Searchable symmetric encryption: improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180417 · Cited by 1,671
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475
Ceph: a scalable, high-performance distributed file system
Weil, S. A., Brandt, S., Miller, E. L., Long, D. D. E., & Maltzahn, C. (2006) · eScholarship (California Digital Library) · doi:10.5555/1298455.1298485 · Cited by 1,402
Dynamo: amazon's highly available key-value store
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., & Vogels, W. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1323293.1294281 · Cited by 1,151
Searchable symmetric encryption: Improved definitions and efficient constructions
Curtmola, R., Garay, J., Kamara, S., & Ostrovsky, R. (2011) · Journal of Computer Security · doi:10.3233/jcs-2011-0426 · Cited by 914
Deterministic and Efficiently Searchable Encryption
Bellare, M., Boldyreva, A., & O’Neill, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_30 · Cited by 745
Message-Locked Encryption and Secure Deduplication
Bellare, M., Keelveedhi, S., & Ristenpart, T. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_18 · Cited by 632
MR-PDP: Multiple-Replica Provable Data Possession
Curtmola, R., Khan, O., Burns, R., & Ateniese, G. (2008) · 2008 The 28th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2008.68 · Cited by 473
Secure Untrusted Data Repository (SUNDR)
Li, J., Krohn, M., Mazieres, D., & Shasha, D. (2003) · doi:10.21236/ada445862 · Cited by 394
Live wide-area migration of virtual machines including local persistent state
Bradford, R., Kotsovinos, E., Feldmann, A., & Schiöberg, H. (2007) · Proceedings of the 3rd international conference on Virtual execution environments · doi:10.1145/1254810.1254834 · Cited by 394
Survey of research towards robust peer-to-peer networks: Search methods
Risson, J., & Moors, T. (2006) · Computer Networks · doi:10.1016/j.comnet.2006.02.001 · Cited by 386
Microreboot -- A Technique for Cheap Recovery
Candea, G., Kawamoto, S., Fujiki, Y., Friedman, G., & Fox, A. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0406005 · Cited by 380
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095817 · Cited by 368
Efficient Byzantine Fault-Tolerance
Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., & Verissimo, P. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.221 · Cited by 337
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 309
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Storer, M. W., Greenan, K., Long, D. D. E., & Miller, E. L. (2008) · Proceedings of the 4th ACM international workshop on Storage security and survivability · doi:10.1145/1456469.1456471 · Cited by 288
Speculative execution in a distributed file system
Nightingale, E. B., Chen, P. M., & Flinn, J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095829 · Cited by 94
Metadata
- Authors
- Adya, A., Bolosky, W. J., Castro, M., Cermak, G., Chaiken, R., Douceur, J. R., Howell, J., Lorch, J. R., Theimer, M., & Wattenhofer, R. P.
- Venue
- ACM SIGOPS Operating Systems Review
- Published
- 2002-12-31
- Volume
- 36
- Issue
- SI
- Pages
- 1-14
- ISSN
- 0163-5980 (ISSN-L)
- OpenAlex
- W2121133177
- Cited by
- 780
- References
- 29
- FWCI
- 46.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.