The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
DepSky: Dependable and Secure Storage in a Cloud-of-Clouds
Abstract
The increasing popularity of cloud storage services has lead companies that handle critical data to think about using these services for their storage needs. Medical record databases, large biomedical datasets, historical information about power systems and financial data are some examples of critical data that could be moved to the cloud. However, the reliability and security of data stored in the cloud still remain major concerns. In this work we present DepSky, a system that improves the availability, integrity, and confidentiality of information stored in the cloud through the encryption, encoding, and replication of the data on diverse clouds that form a cloud-of-clouds. We deployed our system using four commercial clouds and used PlanetLab to run clients accessing the service from different countries. We observed that our protocols improved the perceived availability, and in most cases, the access latency, when compared with cloud providers individually. Moreover, the monetary costs of using DepSky in this scenario is at most twice the cost of using a single cloud, which is optimal and seems to be a reasonable cost, given the benefits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945450 · Cited by 4,984
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
ZooKeeper: wait-free coordination for internet-scale systems
Hunt, P. G., Konar, M., Junqueira, F., & Reed, B. C. (2010) · USENIX Annual Technical Conference · Cited by 1,968
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945450 · Cited by 1,423
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
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Vogels, W. (2009) · Communications of the ACM · doi:10.1145/1435417.1435432 · Cited by 1,013
On interprocess communication: Part I: Basic formalism
Lamport, L. (1986) · Distributed Computing · doi:10.1007/bf01786227 · Cited by 861
Network Time Protocol (Version 3) Specification, Implementation and Analysis
Mills, D. L. (1992) · doi:10.17487/rfc1305 · Cited by 851
Bowers, K. D., Juels, A., & Oprea, A. (2009) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/1653662.1653686 · Cited by 749
Proceedings of the 2017 USENIX Annual Technical Conference (USENIX ATC ’17)
Quoc, D. L., Beck, M. S., Bhatotia, P., Chen, R., Fetzer, C. W., & Strufe, T. (2017) · Cited by 611
Malkhi, D., & Reiter, M. (1998) · Distributed Computing · doi:10.1007/s004460050050 · Cited by 530
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
Schoenmakers, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_10 · Cited by 448
Session guarantees for weakly consistent replicated data
Terry, D., Demers, A. J., Petersen, K., Spreitzer, M., Theimer, M. M., & Welch, B. B. (2002) · International Conference on Parallel and Distributed Information Systems · doi:10.1109/pdis.1994.331722 · Cited by 430
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_12 · Cited by 359
A cost-effective, high-bandwidth storage architecture
Gibson, G. A., Nagle, D. F., Amiri, K., Butler, J., Chang, F. W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., & Zelenka, J. (1998) · ACM SIGPLAN Notices · doi:10.1145/291006.291029 · Cited by 324
Brantner, M., Florescu, D., Graf, D., Kossmann, D., & Kraska, T. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376645 · Cited by 259
Childhood obesity and insulin-resistant syndrome
Yensel, C. S., Preud’Homme, D., & Curry, D. M. (2004) · Journal of Pediatric Nursing · doi:10.1016/j.pedn.2004.05.006 · Cited by 232
Efficient Byzantine-tolerant erasure-coded storage
Goodson, G. R., Wylie, J. J., Ganger, G. R., & Reiter, M. K. (2004) · International Conference on Dependable Systems and Networks, 2004 · doi:10.1109/dsn.2004.1311884 · Cited by 194
Depot: Cloud Storage with Minimal Trust
Mahajan, P., Setty, S., Lee, S., Clement, A., Alvisi, L., Dahlin, M., & Walfish, M. (2011) · ACM Transactions on Computer Systems · doi:10.1145/2063509.2063512 · Cited by 194
A cost-effective, high-bandwidth storage architecture
Gibson, G. A., Nagle, D. F., Amiri, K., Butler, J., Chang, F. W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., & Zelenka, J. (1998) · Proceedings of the eighth international conference on Architectural support for programming languages and operating systems · doi:10.1145/291069.291029 · Cited by 179
Gafni, E. M., & Lamport, L. (2003) · Distributed Computing · doi:10.1007/s00446-002-0070-8 · Cited by 178
Martin, J.-P., Alvisi, L., & Dahlin, M. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36108-1_21 · Cited by 160
Secure and scalable replication in Phalanx
Malkhi, D., & Reiter, M. K. (2002) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1998.740474 · Cited by 157
End-to-end WAN service availability
Dahlin, M. D., Chandra, B., Gao, L., & Nayate, A. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.810312 · Cited by 141
Muniswamy‐Reddy, K., Macko, P., & Seltzer, M. (2010) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · doi:10.5555/1855511.1855526 · Cited by 140
The byzantine empire in the intercloud
Vukolić, M. (2010) · ACM SIGACT News · doi:10.1145/1855118.1855137 · Cited by 120
SafeStore: a durable and practical storage system
Kotla, R., Alvisi, L., & Dahlin, M. (2007) · Cited by 116
Fault-tolerant wait-free shared objects
Jayanti, P., Chandra, T. D., & Toueg, S. (1998) · Journal of the ACM · doi:10.1145/278298.278305 · Cited by 116
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
Cachin, C., & Tessaro, S. (2006) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2006.56 · Cited by 106
On designing and deploying internet-scale services
Hamilton, J. R. (2007) · Cited by 105
DepSpace: a byzantine fault-tolerant coordination service
Bessani, A., Alchieri, E., Correia, M. P., & Fraga, J. S. (2008) · European Conference on Computer Systems · doi:10.1145/1352592.1352610 · Cited by 100
Self-citationVenus: verification for untrusted cloud storage
Shraer, A., Cachin, C., Cidon, A., Keidar, I., Michalevsky, Y., & Shaket, D. (2010) · Cloud Computing Security Workshop · doi:10.1145/1866835.1866841 · Cited by 98
Low-overhead byzantine fault-tolerant storage
Hendricks, J., Ganger, G. R., & Reiter, M. K. (2007) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/1294261.1294269 · Cited by 95
Active disk paxos with infinitely many processes
Chockler, G. V., & Malkhi, D. (2002) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/571825.571837 · Cited by 69
Tolerating Byzantine Faulty Clients in a Quorum System
Liskov, B. H., & Rodrigues, R. (2006) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2006.83 · Cited by 48
Stout: an adaptive interface to scalable cloud storage
Mccullough, J. C., Dunagan, J., Wolman, A., & Snoeren, A. C. (2010) · Cited by 22
An Analysis of Technical Observations in Insider Theft of Intellectual Property Cases
Hanley, M., Dean, T., Schroeder, W., Houy, M., Trzeciak, R. F., & Montelibano, J. (2011) · Figshare · doi:10.1184/r1/6571895 · Cited by 22
Forecast calls for clouds over biological computing
May, M. (2010) · Nature Medicine · doi:10.1038/nm0110-6a · Cited by 16
Cited by
A Survey on Blockchain Interoperability: Past, Present, and Future Trends
Belchior, R., Vasconcelos, A., Guerreiro, S., & Correia, M. (2022) · ACM Computing Surveys · doi:10.1145/3471140 · Cited by 757
Self-citationSecurity, privacy, and trust management in DNA computing
Fernandes, M., Decouchant, J., & Couto, F. M. (2023) · Advances in Computers · doi:10.1016/bs.adcom.2022.08.009 · Cited by 3
Metadata
- Authors
- Bessani, A., Correia, M., Quaresma, B., André, F., & Sousa, P.
- Venue
- ACM Transactions on Storage
- Published
- 2013-11
- Volume
- 9
- Issue
- 4
- Pages
- 1-33
- ISSN
- 1553-3077 (ISSN-L)
- 1553-3093
- OpenAlex
- W2162460714
- Cited by
- 330
- References
- 43
- FWCI
- 97.47
- 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.