• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

TrInc: Small Trusted Hardware for Large Distributed Systems

Cached

  • Download as a PDF

Download Links

  • [www.research.microsoft.com]
  • [www.research.microsoft.com]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.distcomp.ethz.ch]
  • [disco.ethz.ch]
  • [dcg.ethz.ch]
  • [distcomp.ethz.ch]
  • [www.dcg.ethz.ch]
  • [www.cs.umd.edu]
  • [www.usenix.org]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Dave Levin , John R. Douceur , Jacob R. Lorch , Thomas Moscibroda
Citations:23 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Levin_trinc:small,
    author = {Dave Levin and John R. Douceur and Jacob R. Lorch and Thomas Moscibroda},
    title = {TrInc: Small Trusted Hardware for Large Distributed Systems},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

A simple yet remarkably powerful tool of selfish and malicious participants in a distributed system is “equivocation”: making conflicting statements to others. We present TrInc, a small, trusted component that combats equivocation in large, distributed systems. Consisting fundamentally of only a non-decreasing counter and a key, TrInc provides a new primitive: unique, once-in-alifetime attestations. We show that TrInc is practical, versatile, and easily applicable to a wide range of distributed systems. Its deployment is viable because it is simple and because its fundamental components—a trusted counter and a key—are already deployed in many new personal computers today. We demonstrate TrInc’s versatility with three detailed case studies: attested append-only memory (A2M), PeerReview, and BitTorrent. We have implemented TrInc and our three case studies using real, currently available trusted hardware. Our evaluation shows that TrInc eliminates most of the trusted storage needed to implement A2M, significantly reduces communication overhead in PeerReview, and solves an open incentives issue in BitTorrent. Microbenchmarks of our TrInc implementation indicate directions for the design of future trusted hardware. 1

Citations

3028 Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications - Stoica, Morris, et al. - 2001
1309 Distributed Algorithms - Lynch - 1996
1069 The byzantine generals problem - Lamport, Shostak, et al. - 1982
847 Oceanstore: An architecture for global-scale persistent storage - Kubiatowicz, Bindel, et al. - 2000
640 Incentives Build Robustness in BitTorrent - Cohen - 2003
432 Kademlia: A peer-to-peer information system based on the xor metric - Maymounkov, Mazières - 2002
336 FARSITE: Federated, available, and reliable storage for an incompletely trusted environment - Adya, Bolosky, et al. - 2002
285 Handling churn in a DHT - RHEA, GEELS, et al. - 2004
248 Practical Byzantine Fault Tolerance and Proactive Recovery - Castro, Liskov
232 Ivy: a read/write peer-to-peer file system - Muthitacharoen, Morris, et al. - 2002
212 Sprite: A simple, cheatproof, creditbased system for mobile ad hoc networks - Zhong, Chen, et al. - 2003
111 Secure untrusted data repository (SUNDR - Li, Krohn, et al. - 2004
93 Plutus: Scalable secure file sharing on untrusted storage - Kallahalla, Riedel, et al.
92 Fault-scalable byzantine fault-tolerant services - Abd-El-Malek, Ganger, et al. - 2005
78 Zyzzyva: Speculative Byzantine fault tolerance - Kotla, Alvisi, et al. - 2007
78 Do incentives build robustness in bittorrent - PIATEK, ISDAL, et al. - 2007
70 Cheat-proof playout for centralized and distributed online games - Baughman, Levine - 2001
69 HQ replication: A hybrid quorum protocol for Byzantine fault tolerance - Cowling, Myers, et al. - 2006
68 Free Riding on Gnutella Revisited: The Bell Tolls - Hughes, Coulson, et al. - 2005
66 How to build a trusted database system on untrusted storage - Maheshwari, Vingralek, et al. - 2000
62 PeerReview: Practical Accountability for Distributed Systems - Haeberlen, Kouznetsov, et al. - 2007
54 Free riding in BitTorrent is cheap - Locher, Moor, et al. - 2006
54 KARMA a secure economic framework for p2p resource sharing - Vishnumurthy, Chandrakumar, et al. - 2003
50 Introduction to Modern Cryptography - Katz, Lindell - 2008
45 Attested append-only memory: Making adversaries stick to their word - Chun, Maniatis, et al. - 2007
44 IncentivesCompatible Peer-to-Peer Multicast - Ngan, Wallach, et al. - 2004
35 Designing incentives for peer-to-peer routing - Blanc, Liu, et al. - 2005
35 Bittorrent is an auction: analyzing and improving bittorrent’s incentives - LEVIN, LACURTS, et al.
35 Securing BGP through Secure Origin BGP - White - 2003
32 Dandelion: Cooperative content distribution with robust incentives - SIRIVIANOS, PARK, et al. - 2007
31 Free-riding in BitTorrent networks with the large view exploit - Sirivianos, Park, et al. - 2010
30 Low latency and cheat-proof event ordering for peer-to-peer games - GauthierDickey, Zappala, et al. - 2004
22 Robust incentives via multilevel tit-for-tat - LIAN, PENG, et al. - 2006
17 Tolerating Byzantine faults in transaction processing systems using commit barrier scheduling - Vandiver, Balakrishnan, et al. - 2007
15 CompuP2P: An architecture for sharing of compute power in peer-to-peer networks with selfish nodes - Gupta, Somani - 2004
15 Virtual monotonic counters and count-limited objects using a TPM without a trusted OS - Sarmenta, Dijk, et al. - 2006
14 A flexible and secure auction architecture using trusted hardware - SAM - 1991
9 Nysiad: Practical protocol transformation to tolerate Byzantine failures - Ho, Renesse, et al. - 2008
2 Proof of freshness: How to efficiently use an online single secure clock to secure shared untrusted memory - Dijk, Sarmenta, et al. - 2006
2 Multiagent coordination using a distributed combinatorial auction - Vidal - 2006
1 Secure domain name system (DNS) deplopment guide. Special Publication 800-81 - Chandramouli, Rose - 2006
1 Subversion Version Control: Using the Subversion Version - Nagel - 2005
1 Essential CVS, 2nd Edition - Vesperman - 2006
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University