PeerReview: Practical accountability for distributed systems

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

Volumn , Issue , 2007, Pages 175-188

  Haeberlen, Andreas ^a,b   Kouznetsov, Petr ^a   Druschel, Peter ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b RICE UNIVERSITY   (United States)

Author keywords

Accountability; Byzantine faults; Distributed systems; Fault detection

Indexed keywords

BYZANTINE FAULT; BYZANTINE FAULTS; DISTRIBUTED SYSTEMS; FALSE-ACCUSATION; FAULTY NODE; FILESYSTEM; OVERLAY MULTICAST SYSTEMS; PEER-TO-PEER SYSTEM; REFERENCE IMPLEMENTATION; SIGN MESSAGES;

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER OPERATING SYSTEMS;

FAULT DETECTION;

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

References (59)

1. A. S. Aiyer, L. Alvisi, A. Clement, M. Dahlin, J.-P. Martin, and C. Porth. BAR fault tolerance for cooperative services. In Proc. SOSP'05, Oct 2005.
2. L. Alvisi, D. Malkhi, E. T. Pierce, and M. K. Reiter. Fault detection for Byzantine quorum systems. IEEE Trans. Parallel Distrib. Syst., 12(9):996-1007, 2001.
3. R. Arends, R. Austein, M. Larson, D. Massey, and S. Rose. RFC 4033: DNS security introduction and requirements. http://www.ietf.org/rfc/rfc4033.txt, Mar 2005.
4. K. Argyraki, P. Maniatis, O. Irzak, and S. Shenker. An accountability interface for the Internet. In Proc. 14th ICNP, Oct 2007.
5. E. Barker, W. Barker, W. Burr, W. Polk, and M. Smid. Recommendation for key management. NIST Special Publication 800-57, revised Mar 2007.
6. H. Barringer, A. Goldberg, K. Havelund, and K. Sen. Rule-based runtime verification. In Proc. VMCAI'04, Jan 2004.
7. R. A. Bazzi and G. Neiger. Simplifying fault-tolerance: Providing the abstraction of crash failures. J. ACM, 48(3):499-554, 2001.
8. G. Bracha. Asynchronous Byzantine agreement protocols. Information and Computation, 75(2):130-143, Nov 1987.
9. G. Bracha and S. Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4), 1985.
10. M. Castro. Practical Byzantine Fault Tolerance. PhD thesis, MIT LCS, Jan 2001.
11. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Secure routing for structured peer-to-peer overlay networks. In Proceedings of OSDI'02, Boston, MA, Dec 2002.
12. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. SplitStream: High-bandwidth multicast in cooperative environments. In Proceedings of SOSP'03, Oct 2003.
13. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst., 20(4):398-461, 2002.
14. M. Castro, R. Rodrigues, and B. Liskov. BASE: Using abstraction to improve fault tolerance. ACM Trans. Comput. Syst., 21(3):236-269, 2003.
15. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, Mar 1996.
16. B.-G. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz. Attested append-only memory: Making adversaries stick to their word. In Proc. SOSP, Oct 2007.
17. B. A. Coan. A compiler that increases the fault tolerance of asynchronous protocols. IEEE Trans. Computers, 37(12):1541-1553, 1988.
18. L. P. Cox and B. D. Noble. Samsara: Honor among thieves in peer-to-peer storage. In Proceedings of SOSP, Oct 2003.
19. D. E. Denning. An intrusion-detection model. IEEE Trans. on Software Engineering, 13(2):222-232, 1987.
20. R. Dingledine, M. J. Freedman, and D. Molnar. Peer-to-Peer: Harnessing the Power of Disruptive Technologies, chapter Accountability. O'Reilly and Associates, 2001.
21. J. R. Douceur. The Sybil attack. In Proceedings of IPTPS, Mar 2002.
22. A. Doudou, B. Garbinato, R. Guerraoui, and A. Schiper. Muteness failure detectors: Specification and implementation. In EDCC, pages 71-87, 1999.
23. T. Garfinkel, M. Rosenblum, and D. Boneh. Flexible OS support and applications for trusted computing. In Proc. HotOS'03, May 2003.
24. A. Haeberlen, P. Kouznetsov, and P. Druschel. PeerReview: Practical accountability for distributed systems. Technical Report 2007-3, Max Planck Institute for Software Systems.
25. A. Haeberlen, P. Kouznetsov, and P. Druschel. The case for Byzantine fault detection. In Proceedings of HotDep, Nov 2006.
26. A. Haeberlen, A. Mislove, and P. Druschel. Glacier: Highly durable, decentralized storage despite massive correlated failures. In Proc. NSDI, May 2005.
27. M. Jelasity, A. Montresor, and O. Babaoglu. Detection and removal of malicious peers in gossip-based protocols. In Proceedings of FuDiCo, Jun 2004.
28. S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The EigenTrust algorithm for reputation management in p2p networks. In Proc. 12th International WWW Conference, May 2003.
29. D. R. Karger, E. Lehman, F. T. Leighton, R. Panigrahy, M. S. Levine, and D. Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In STOC, 1997.
30. S. T. Kent, C. Lynn, J. Mikkelson, and K. Seo. Secure border gateway protocol (S-BGP) - real world performance and deployment issues. In NDSS, 2000.
31. K. P. Kihlstrom, L. E. Moser, and P. M. Melliar-Smith. Byzantine fault detectors for solving consensus. The Computer Journal, 46(1):16-35, 2003.
32. C. Ko, G. Fink, and K. Levitt. Automated detection of vulnerabilities in privileged programs using execution monitoring. In Proceedings of the 10th Computer Security Application Conference, Dec 1994.
33. L. Lamport. Using time instead of timeout for fault-tolerant distributed systems. ACM Trans. Prog. Lang. Syst., 6(2):254-280, 1984.
34. L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, 1982.
35. B. W. Lampson. Computer security in the real world. In Proc. Annual Computer Security Applications Conference, Dec 2000.
36. P. Laskowski and J. Chuang. Network monitors and contracting systems: competition and innovation. In Proc. SIGCOMM'06, pages 183-194, Sep 2006.
37. J. Li, M. Krohn, D. Mazières, and D. Sasha. Secure untrusted data repository (SUNDR). In Proceedings of OSDI 2004, Dec 2004.
38. D. Malkhi and M. K. Reiter. Unreliable intrusion detection in distributed computations. In CSFW, pages 116-125, 1997.
39. P. Maniatis and M. Baker. Secure history preservation through timeline entanglement. In Proc. of the 11th USENIX Security Symposium, Jan 2002.
40. A. Mislove, A. Post, A. Haeberlen, and P. Druschel. Experiences in building and operating ePOST, a reliable peer-to-peer application. In Proceedings of EuroSys 2006, Apr 2006.
41. A. Nandi, T.-W. Ngan, A. Singh, P. Druschel, and D. Wallach. Scrivener: Providing incentives in cooperative content distribution systems. In Proc. Middleware Conference, Nov 2005.
42. M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. USENIX Security Symposium, pages 217-228, 1998.
43. G. Neiger and S. Toueg. Automatically increasing the fault-tolerance of distributed systems. In PODC, pages 248-262, 1988.
44. D. Oppenheimer, A. Ganapathi, and D. A. Patterson. Why do internet services fail, and what can be done about it? In Proc. USITS'03, Mar 2003.
45. M. C. Pease, R. E. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
46. PeerReview project homepage. http://peerreview.mpi-sws.mpg.de/.
47. H. V. Ramasamy, A. Agbaria, and W. H. Sanders. A parsimonious approach for obtaining resource-efficient and trustworthy execution. IEEE Trans. on Dependable and Secure Comp., 4(1):1-17, Jan 2007.
48. P. Reynolds, O. Kennedy, E. G. Sirer, and F. B. Schneider. Securing BGP using external security monitors. Technical Report 2006-2065, Cornell University, Computing and Inform. Science, Dec 2006.
49. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys, 22(4):299-319, 1990.
50. B. Schneier and J. Kelsey. Cryptographic support for secure logs on untrusted machines. In Proc. 7th USENIX Security Symposium, pages 53-62, Jan 1998.
51. A. Singh, T.-W. Ngan, P. Druschel, and D. Wallach. Eclipse attacks on overlay networks: Threats and defenses. In Proceedings of INFOCOM, Apr 2006.
52. T. K. Srikanth and S. Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80-94, 1987.
53. Sun Microsystems Inc. RFC 1094: Network file system protocol specification. http://www.ietf.org/rfc/rfc1094.txt, Mar 1989.
54. M. Waldman and D. Mazières. Tangler: a censorship-resistant publishing system based on document entanglements. In Proc. 8th ACM conf. on Comp. and Comm. Security, pages 126-135, 2001.
55. K. Walsh and E. G. Sirer. Experience with an object reputation system for peer-to-peer filesharing. In Proc. NSDI, May 2006.
56. J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin. Separating agreement from execution for Byzantine fault tolerant services. In Proc. SOSP, pages 253-267, Oct 2003.
57. A. R. Yumerefendi and J. S. Chase. Trust but verify: Accountability for internet services. In ACM SIGOPS European Workshop, 2004.
58. A. R. Yumerefendi and J. S. Chase. The role of accountability in dependable distributed systems. In Proceedings of HotDep, Jun 2005.
59. A. R. Yumerefendi and J. S. Chase. Strong accountability for network storage. In FAST, 2007.