TRINC: Small trusted hardware for large distributed systems

Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2009

Volumn , Issue , 2009, Pages 1-14

  Levin, Dave ^a   Douceur, John R ^b   Lorch, Jacob R ^b   Moscibroda, Thomas ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; PERSONAL COMPUTERS; SYSTEMS ANALYSIS;

CASE-STUDIES; COMMUNICATION OVERHEADS; DISTRIBUTED SYSTEMS; FUNDAMENTAL COMPONENT; MALICIOUS PARTICIPANT; MICRO-BENCHMARKS; TRUSTED COMPONENTS; TRUSTED HARDWARES;

DISTRIBUTED COMPUTER SYSTEMS;

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

References (45)

1. M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie. Fault-scalable Byzantine fault-tolerant services. In Proc. 20th ACM Symposium on Operating Systems Principles (SOSP), pp. 59-74, 2005.
2. A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. Howell, J. R. Lorch, M. Theimer, and R. Wattenhofer. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proc. Symposium on Operating Systems Design and Implementation (OSDI), pp. 1-14, 2002.
3. N. E. Baughman and B. N. Levine. Cheat-proof playout for centralized and distributed online games. In Proc. Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), pp. 104-113, 2001.
4. A. Blanc, Y.-K. Liu, and A. Vahdat. Designing incentives for peer-to-peer routing. In Proc. NetEcon, 2004.
5. M. Castro and B. Liskov. Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems (TOCS), 20(4):398-461, 2002.
6. R. Chandramouli and S. Rose. Secure domain name system (DNS) deplopment guide. Special Publication 800-81, NIST, 2006.
7. B.-G. Chun, P. Maniatis, S. Shenker, and J. Kubiatowicz. Attested append-only memory: Making adversaries stick to their word. In Proc. Symposium on Operating Systems Principles (SOSP), pp. 189-204, 2007.
8. B. Cohen. Incentives build robustness in BitTorrent. In P2PEcon, 2003.
9. J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. HQ replication: A hybrid quorum protocol for Byzantine fault tolerance. In Proc. Symposium on Operating Systems Design and Implementation (OSDI), pp. 177-190, 2006.
10. C. GauthierDickey, D. Zappala, V. Lo, and J. Marr. Low latency and cheat-proof event ordering for peer-to-peer games. In NOSSDAV, 2004.
11. Gemalto. http://www.gemalto.com/.
12. R. Gupta and A. K. Somani. CompuP2P: An architecture for sharing of compute power in peer-to-peer networks with selfish nodes. In Proc. NetEcon, 2004.
13. A. Haeberlen, P. Kuznetsov, and P. Druschel. PeerReview: Practical accountability for distributed systems. In Proc. Symposium on Operating Systems Principles (SOSP), pp. 175-188, 2007.
14. C. Ho, R. van Renesse, M. Bickford, and D. Dolev. Nysiad: Practical protocol transformation to tolerate Byzantine failures. In Proc. Symposium on Networked Systems Design and Implementation (NSDI), pp. 175-188, 2008.
15. D. Hughes, G. Coulson, and J. Walkerdine. Free riding on Gnutella revisited: The bell tolls? IEEE Distributed Systems Online, 6(6):1-18, 2005.
16. M. Kallahalla, E. Riedel, R. Swaminathan, Q. Wang, and K. Fu. Plutus: Scalable secure file sharing on untrusted storage. In Proc. USENIX Conference on File and Storage Technologies (FAST), pp. 29-42, 2003.
17. J. Katz and Y. Lindell. Introduction to Modern Cryptography. CRC Press, 2007.
18. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative Byzantine fault tolerance. In Proc. Symposium on Operating Systems Principles (SOSP), pp. 45-58, 2007.
19. J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proc. Conference on Architecture Support for Programming Languages and Operating Systems (ASPLOS), 2000.
20. L. Lamport, R. E. Shostak, and M. C. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):382-401, 1982.
21. D. Levin, K. LaCurts, N. Spring, and B. Bhattacharjee. BitTorrent is an auction: Analyzing and improving BitTorrent's incentives. In Proc. SIGCOMM Conference on Data Communication, pp. 243-254, 2008.
22. J. Li, M. N. Krohn, D. Mazières, and D. Shasha. Secure Untrusted Data Repository (SUNDR). In Proc. Symposium on Operating Systems Design and Implementation (OSDI), pp. 121-136, 2004.
23. Q. Lian, Y. Peng, M. Yang, Z. Zhang, Y. Dai, and X. Li. Robust incentives via multi-level tit-for-tat. In Proc. Workshop on Peer-to-Peer Systems (IPTPS), 2006.
24. T. Locher, P. Moor, S. Schmid, and R. Wattenhofer. Free riding in BitTorrent is cheap. In Proc. Workshop on Hot Topics in Networks (HotNets), pp. 85-90, 2006.
25. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996.
26. U. Maheshwari, R. Vingralek, and W. Shapiro. How to build a trusted database system on untrusted storage. In Proc. Symposium on Operating Systems Design and Implementation (OSDI), pp. 135-150, 2000.
27. P. Maymounkov and D. Mazières. Kademlia: A peer-to-peer information system based on the XOR metric. In Proc. Workshop on Peer-to-Peer Systems (IPTPS), pp. 109-114, 2002.
28. A. Muthitacharoen, R. Morris, T. Gil, and B. Chen. Ivy: A read/write peer-to-peer file system. In Proc. Symposium on Operating Systems Design and Implementation (OSDI), pp. 31-44, 2002.
29. W. Nagel. Subversion Version Control: Using the Subversion Version Control System in Development Projects. Prentice Hall, 2005.
30. T.-W. Ngan, D. S. Wallach, and P. Druschel. Incentives-compatible peer-to-peer multicast. In Proc. NetEcon, 2004.
31. A. Perrig, S. Smith, D. Song, and J. D. Tygar. SAM: A flexible and secure auction architecture using trusted hardware. In ICEC, 2001.
32. M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Do incentives build robustness in BitTorrent? In Proc. Symposium on Networked Systems Design and Implementation (NSDI), pp. 1-14, 2007.
33. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In Proc. USENIX Annual Technical Conference, pp. 127-140, 2004.
34. L. F. G. Sarmenta, M. van Dijk, C. W. O'Donnell, J. Rhodes, and S. Devadas. Virtual monotonic counters and count-limited objects using a TPM without a trusted OS. In Proc. Workshop on Scalable Trusted Computing (STC), 2006.
35. M. Sirivianos, J. H. Park, R. Chen, and X. Yang. Free-riding in BitTorrent networks with the large view exploit. In Proc. Workshop on Peer-to-Peer Systems (IPTPS), 2007.
36. M. Sirivianos, J. H. Park, X. Yang, and S. Jarecki. Dandelion: Cooperative content distribution with robust incentives. In Proc. USENIX Annual Technical Conference, pp. 157-170, 2007.
37. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proc. SIGCOMM Conference on Data Communication, pp. 149-160, 2001.
38. Trusted Computing Group. Trusted Platform Module Specifications. Online at https://www.trustedcomputinggroup.org/specs/TPM/.
39. M. van Dijk, L. F. G. Sarmenta, C. W. O'Donnell, and S. Devadas. Proof of freshness: How to efficiently use an online single secure clock to secure shared untrusted memory. Technical report, 2006.
40. B. Vandiver, H. Balakrishnan, B. Liskov, and S. Madden. Tolerating Byzantine faults in transaction processing systems using commit barrier scheduling. In Proc. Symposium on Operating Systems Principles (SOSP), pp. 59-72, 2007.
41. J. Vesperman. Essential CVS, 2nd Edition. O'Reilly, 2006.
42. J. M. Vidal. Multiagent coordination using a distributed combinatorial auction. In AAAI Workshop on Auction Mechanisms for Robot Coordination, 2006.
43. V. Vishnumurthy, S. Chandrakumar, and E. G. Sirer. KARMA: A Secure Economic Framework for P2P Resource Sharing. In Proc. NetEcon, 2003.
44. R. White. Securing BGP through Secure Origin BGP. Internet Protocol Journal, 6(3), 2003.
45. S. Zhong, J. Chen, and Y. R. Yang. Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In Proc. Joint Conference of the IEEE Computer and Communication Societies (INFOCOM), 2003.