Attested append-only memory: Making adversaries stick to their word

SOSP'07 - Proceedings of 21st ACM SIGOPS Symposium on Operating Systems Principles

Volumn , Issue , 2007, Pages 189-204

  Chun, Byung Gon ^a   Maniatis, Petros ^b   Shenker, Scott ^a,c   Kubiatowicz, John ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INTEL RESEARCH   (United States)

^c ICSI   (United States)

Author keywords

Attested append only memory; Byzantine fault tolerance; Equivocation; Replicated state machines; Shared storage

Indexed keywords

BYZANTINE FAULT TOLERANCE; COMMON SOURCE; FAULT-TOLERANT; IS COSTS; LINEARIZABILITY; PROGRAMMING ABSTRACTIONS; PROTOCOL DESIGN; REPLICATED SYSTEMS; SHARED STORAGE; STATE MACHINE; STATE OF THE ART; TRUSTED SYSTEMS; UPPER BOUND;

ABSTRACTING; COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING; CONTOUR FOLLOWERS; FAULT TOLERANT COMPUTER SYSTEMS; QUALITY ASSURANCE; SERVERS;

FAULT TOLERANCE;

EID: 59249102694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (40)

1. Amazon S3. http://aws.amazon.com/s3/.
2. Intel Active Management Technology (AMT). http://www.intel.com/ technology/platform-technology/intel-amt/index.htm.
3. Java. http://java.sun.com/.
4. SFSlite. http://www.okws.org/doku.php?id=sfslite.
5. Trusted Computing Group (TCG). http://www.trustedcomputinggroup.org/.
6. M. Abd-El-Malek, G. Ganger, G. Goodson, M. Reiter, and J. Wylie. Fault-scalable byzantine fault-tolerant services. In Proc. of SOSP, 2005.
7. A. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.-P. Martin, and C. Porth. BAR fault tolerance for cooperative services. In Proc. of SOSP, 2005.
8. T. W. Arnold and L. P. V. Doorn. The IBM PCIXCC: A new cryptographic coprocessor for the IBM eServer. IBM Journal of Research and Development, 48(3/4):475-487, 2004.
9. M. H. Azmanesh and R. M. Kieckhafer. New hybrid fault models for asynchronous approximate agreement. IEEE Trans. on Computers, 45(4):439-449, 1996.
10. P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R. Neugebauer, I. Pratt, and A. Warfield. Xen and the art of virtualization. In Proc. of SOSP, 2003.
11. S. Berger, R. Cáceres, K. A. Goldman, R. Perez, R. Sailer, and L. van Doorn. vTPM: Virtualizing the trusted platform module. In Proc. of USENIX Security, 2006.
12. M. Castro and B. Liskov. Practical Byzantine fault tolerance. In Proc. of OSDI, 1999.
13. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. on Computer Systems, 20(4):398-461, 2002.
14. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proc. of OSDI, 2006.
15. S. Haber and W. S. Stornetta. How to time-stamp a digital document. Journal of Cryptology, 3(2):99-111, 1991.
16. A. Haeberlen, P. Kouznetsov, and P. Druschel. PeerReview: Practical accountability for distributed systems. In Proc. of SOSP, 2007.
17. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. on Programming Languages and Systems, 12(3):463-492, 1990.
18. G. Hunt, M. Aiken, M. Fähndrich, C. Hawblitzel, O. Hodson, J. Larus, B. Steensgaard, D. Tarditi, and T. Wobber. Sealing OS processes to improve dependability and safety. In Proc. of EuroSys, 2007.
19. G. Hunt and J. Larus. Singularity: Rethinking the software stack. Operating Systems Review, 41(2):37-49, 2007.
20. M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu. Plutus: Scalable secure file sharing on untrusted storage. In Proc. of USENIX FAST, 2003.
21. R. M. Kieckhafer and M. H. Azamanesh. Reaching approximate agreement with mixed mode faults. IEEE Trans. on Parallel and Distributed Systems, 3(1):53-63, 1994.
22. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative Byzantine fault tolerance. In Proc. of SOSP, 2007.
23. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, 1978.
24. L. Lamport. The part-time parliament. ACM Trans. on Computer Systems, 16(2):133-169, 1998.
25. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. on Programming Languages and Systems, 4(3):382-401, 1982.
26. J. Li, M. Krohn, D. Mazières, and D. Shasha. Secure untrusted data repository (SUNDR). In Proc. of OSDI, 2004.
27. J. Li and D. Mazières. Beyond One-third Faulty Replicas in Byzantine Fault Tolerant Systems. In Proc. of NSDI, 2007.
28. D. Malkhi and M. Reiter. Byzantine quorum systems. In Proc. of STOC, 1997.
29. D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Trans. on Knowledge and Data Engineering, 12(2):187-202, 2000.
30. P. Maniatis and M. Baker. Secure history preservation through timeline entanglement. In Proc. of USENIX Security, 2002.
31. L. McVoy and C. Staelin. lmbench: Portable tools for performance analysis. In Proc. of USENIX ATC, 1996.
32. R. C. Merkle. A digital signature based on a conventional encryption function. In Proc. of CRYPTO, 1987.
33. A. Muthitacharoen, R. Morris, T. M. Gil, and B. Chen. Ivy: A read/write peer-to-peer file system. In Proc. of OSDI, 2002.
34. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
35. K. Petersen, M. Spreitzer, D. Terry, M. Theimer, and A. Demers. Flexible update propagation for weakly consistent replication. In Proc. of SOSP, 1997.
36. R. Rodrigues, M. Castro, and B. Liskov. BASE: Using abstraction to improve fault tolerance. In Proc. of SOSP, 2001.
37. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299-319, 1990.
38. P. Thambidurai and Y.-K. Park. Interactive consistency with multiple failure modes. In Proc. of SRDS, 1988.
39. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for Byzantine fault tolerant services. In Proc. of SOSP, 2003.
40. A. R. Yumerefendi and J. S. Chase. Strong accountability for network storage. In Proc. of USENIX FAST, 2007.