Efficient fork-linearizable access to untrusted shared memory

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 129-138

  Cachin, Christian ^a   Shelat, Abhi ^a   Shraer, Alexander ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Arbitrary failures; Fork consistency; Storage emulations

Indexed keywords

DATA STORAGE EQUIPMENT; NETWORK PROTOCOLS; WEB SERVICES;

ARBITRARY FAILURES; FORK-CONSISTENCY; STORAGE EMULATIONS;

RANDOM ACCESS STORAGE;

EID: 36849043102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281121     Document Type: Conference Paper

References (20)

1. I. Abraham, G. Chockler, I. Keidar, and D. Malkhi. Byzantine disk Paxos: Optimal resilience with Byzantine shared memory. Distributed Computing, 18(5):387-408, 2006.
2. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. Wiley, second edition, 2004.
3. M. Blum, W. Evans, P. Gemmell, S. Kannan, and M. Naor. Checking the correctness of memories. Algorithmica, 12:225-244, 1994.
4. C. Cachin, A. Shelat, and A. Shraer. Efficient fork-linearizable access to untrusted shared memory. TR RZ3688, IBM Research, Apr. 2007.
5. D. Clarke, S. Devadas, M. van Dijk, B. Gassend, and G. E. Suh. Incremental multiset hash functions and their application to memory integrity checking. In ASIACRYPT 2003.
6. D. Clarke, G. E. Suh, B. Gassend, A. Sudan, M. van Dijk, and S. Devadas. Towards constant bandwidth overhead integrity checking of untrusted data. In Proc. 26th IEEE Symposium on Security & Privacy, 2005.
7. K. Fu, F. Kaashoek, and D. Mazières. Fast and secure distributed read-only file system. ACM Transactions on Computer Systems, 20(1): 1-24, Feb. 2002.
8. K. E. Fu. Group sharing and random access in cryptographic storage file systems. Master Thesis, MIT LCS, 1998.
9. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 11(1): 124-149, Jan. 1991.
10. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In ICDCS 2003, pages 522-529.
11. M. R Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990.
12. R Jayanti, T. D. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. J. ACM, 45(3):451-500, May 1998.
13. L. Lamport. On interprocess communication. Distributed Computing, 1(2):77-85, 86-101, 1986.
14. J. Li, M. Krohn, D. Mazires, and D. Shasha. Secure untrusted data repository (SUNDR). In OSDI, pages 121-136, 2004.
15. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, San Francisco, 1996.
16. N. A. Lynch and M. R. Tuttle. An introduction to input/output automata. CWI Quaterly, 2(3):219-246, Sept. 1989.
17. J.-R Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In DISC 2002, pages 311-325.
18. D. Mazières and D. Shasha. Building secure file systems out of Byzantine storage. In PODC, pages 108-117, 2002.
19. A. Oprea and M. K. Reiter. On consistency of encrypted files. In DISC, pages 254-268, 2006.
20. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, Apr. 1980.