Fail-aware untrusted storage

SIAM Journal on Computing

Volumn 40, Issue 2, 2011, Pages 493-533

  Cachin, Christian ^a   Keidar, Idit ^b   Shraer, Alexander ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c YAHOO RESEARCH   (United States)

Author keywords

Cloud storage; Consistency; Forking semantics; Hashing; Integrity

Indexed keywords

CONSISTENCY; CONSISTENCY PROPERTY; EVENTUAL CONSISTENCY; FAILURE DETECTION; FORKING SEMANTICS; HASHING; INTEGRITY; LINEARIZABILITY; LIVENESS; ON-LINE SERVICE; SERVICE GUARANTEES; STORAGE SERVICES; WAIT-FREEDOM;

ABSTRACTING; DISTRIBUTED COMPUTER SYSTEMS;

SEMANTICS;

EID: 79957455464     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090751062     Document Type: Article

References (26)

1. R. Baldoni, A. Milani, and S. T. Piergiovanni, Optimal propagation-based protocols implementing causal memories, Distrib. Comput., 18 (2006), pp. 461-474. (Pubitemid 43824396)
2. K. P. Birman and T. A. Joseph, Reliable communication in the presence of failures, ACM Trans. Comput. Syst., 5 (1987), pp. 47-76.
3. C. Cachin, I. Keidar, and A. Shraer, Fork sequential consistency is blocking, Inform. Process. Lett., 109 (2009), pp. 360-364.
4. C. Cachin, A. Shelat, and A. Shraer, Efficient fork-linearizable access to untrusted shared memory, in Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC), 2007, pp. 129-138. (Pubitemid 350229309)
5. G. V. Chockler, I. Keidar, and R. Vitenberg, Group communication specifications: A comprehensive study, ACM Comput. Surv., 33 (2001), pp. 427-469. (Pubitemid 33720522)
6. B.-G. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz, Attested append-only memory: Making adversaries stick to their word, in Proceedings of the 21st ACM Symposium on Operating System Principles (SOSP), 2007, pp. 189-204. (Pubitemid 351429376)
7. F. Cristian and C. Fetzer, The timed asynchronous distributed system model, IEEE Trans. Parallel Distrib. Systems, 10 (1999), pp. 642-657.
8. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, Dynamo: Amazon's highly available key-value store, in Proceedings of the 21st ACM Symposium on Operating System Principles (SOSP), 2007, pp. 205-220. (Pubitemid 351429377)
9. C. Fetzer and F. Cristian, Fail-awareness in timed asynchronous systems, in Proceedings of the 18th ACM Symposium on Principles of Distributed Computing (PODC), 1996, pp. 314-321.
10. A. Haeberlen, P. Kouznetsov, and P. Druschel, PeerReview: Practical accountability for distributed systems, in Proceedings of the 21st ACM Symposium on Operating System Principles (SOSP), 2007, pp. 175-188. (Pubitemid 351429375)
11. M. Herlihy, Wait-free synchronization, ACM Trans. Program. Lang. Syst., 11 (1991), pp. 124-149. (Pubitemid 23600427)
12. M. P. Herlihy and J. M. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Program. Lang. Syst., 12 (1990), pp. 463-492.
13. P. W. Hutto and M. Ahamad, Slow memory: Weakening consistency to enhance concurrency in distributed shared memories, in Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS), 1990, pp. 302-309.
14. J. J. Kistler and M. Satyanarayanan, Disconnected operation in the Coda file system, ACM Trans. Comput. Syst., 10 (1992), pp. 3-25. (Pubitemid 23598980)
15. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. ACM, 21 (1978), pp. 558-565. (Pubitemid 8615486)
16. J. Li, M. Krohn, D. Mazières, and D. Shasha, Secure untrusted data repository (SUNDR), in Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI), 2004, pp. 121-136.
17. J. Li and D. Mazières, Beyond one-third faulty replicas in Byzantine fault tolerant systems, in Proceedings of the 4th Symposium on Networked Systems Design and Implementation (NSDI), 2007.
18. N. A. Lynch, Distributed Algorithms, Morgan Kaufmann, San Francisco, 1996.
19. T. Marian, M. Balakrishnan, K. Birman, and R. van Renesse, Tempest: Soft state replication in the service tier, in Proceedings of the International Conference on Dependable Systems and Networks (DSN-DCCS), 2008, pp. 227-236.
20. D. Mazières and D. Shasha, Building secure file systems out of Byzantine storage, in Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002, pp. 108-117.
21. A. Oprea and M. K. Reiter, On consistency of encrypted files, in Proceedings of the 20th International Conference on Distributed Computing (DISC), Lecture Notes in Comput. Sci. 4167, S. Dolev, ed., Springer, Berlin, 2006, pp. 254-268. (Pubitemid 44849715)
22. Y. Saito and M. Shapiro, Optimistic replication, ACM Comput. Surv., 37 (2005), pp. 42-81. (Pubitemid 41246322)
23. A. Singh, P. Fonseca, P. Kuznetsov, R. Rodrigues, and P. Maniatis, Zeno: Eventually consistent Byzantine fault tolerance, in Proceedings of the 6th Symposium on Networked Systems Design and Implementation (NSDI), 2009, pp. 169-184.
24. D. B. Terry, M. Theimer, K. Petersen, A. J. Demers, M. Spreitzer, and C. Hauser, Managing update conflicts in Bayou, a weakly connected replicated storage system, in Proceedings of the 15th ACM Symposium on Operating System Principles (SOSP), 1995,
25. J. Yang, H. Wang, N. Gu, Y. Liu, C. Wang, and Q. Zhang, Lock-free consistency control for Web 2.0 applications, in Proceedings of the 17th International Conference on World Wide Web (WWW), 2008, pp. 725-734.
26. A. R. Yumerefendi and J. S. Chase, Strong accountability for network storage, ACMTrans. Storage, 3 (2007), article 11.