{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:34Z","timestamp":1763468074378,"version":"3.41.0"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0747052"],"award-info":[{"award-number":["CNS-0747052"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p>Existing backup systems are unsatisfactory: commercial backup services are reliable but expensive while peer-to-peer systems are cheap but offer limited assurance of data reliability. This article introduces Friendstore, a system that provides inexpensive and reliable backup by giving users the choice to store backup data only on nodes they trust (typically those owned by friends and colleagues). Because it is built on trusted nodes, Friendstore is not burdened by the complexity required to cope with potentially malicious participants. Friendstore only needs to detect and repair accidental data loss and to ensure balanced storage exchange. The disadvantage of using only trusted nodes is that Friendstore cannot achieve perfect storage utilization.<\/jats:p>\n          <jats:p>Friendstore is designed for a heterogeneous environment where nodes have very different access link speeds and available disk spaces. To ensure long-term data reliability, a node with limited upload bandwidth refrains from storing more data than its calculated maintainable capacity. A high bandwidth node might be limited by its available disk space. We introduce a simple coding scheme, called XOR(1,2), which doubles a node's ability to store backup information in the same amount of disk space at the cost of doubling the amount of data transferred during restore. Analysis and simulations using long-term node activity traces show that a node can reliably back up tens of gigabytes of data even with low upload bandwidth.<\/jats:p>","DOI":"10.1145\/2339118.2339119","type":"journal-article","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T14:51:51Z","timestamp":1347979911000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Efficient cooperative backup with decentralized trust management"],"prefix":"10.1145","volume":"8","author":[{"given":"Nguyen","family":"Tran","sequence":"first","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Chiang","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinyang","family":"Li","sequence":"additional","affiliation":[{"name":"New York University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,9,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060291"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095816"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217957"},{"key":"e_1_2_1_4_1","unstructured":"Batten C. Barr K. Saraf A. and Trepetin S. 2002. pstore: A secure peer-to-peer backup system. Tech. rep. MIT-LCS-TM-632 Massachusetts Institute of Technology.  Batten C. Barr K. Saraf A. and Trepetin S. 2002. pstore: A secure peer-to-peer backup system. Tech. rep. MIT-LCS-TM-632 Massachusetts Institute of Technology."},{"volume-title":"Proceedings of the ACM\/USENIX Symposium on Networked Systems Design and Implementation (NSDI).","author":"Bhagwan R.","key":"e_1_2_1_5_1","unstructured":"Bhagwan , R. , Tati , K. , Cheng , Y. , Savage , S. , and Voelker , G. M . 2004. Totalrecall: System support for automated availability management . In Proceedings of the ACM\/USENIX Symposium on Networked Systems Design and Implementation (NSDI). Bhagwan, R., Tati, K., Cheng, Y., Savage, S., and Voelker, G. M. 2004. Totalrecall: System support for automated availability management. In Proceedings of the ACM\/USENIX Symposium on Networked Systems Design and Implementation (NSDI)."},{"volume-title":"Proceedings of the 9th Workshop on Hot Topics in Operating Systems.","author":"Blake C.","key":"e_1_2_1_6_1","unstructured":"Blake , C. and Rodrigues , R . 2003. High availability, scalable storage, dynamic peer networks: Pick two . In Proceedings of the 9th Workshop on Hot Topics in Operating Systems. Blake, C. and Rodrigues, R. 2003. High availability, scalable storage, dynamic peer networks: Pick two. In Proceedings of the 9th Workshop on Hot Topics in Operating Systems."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/339331.339345"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653686"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1655008.1655015"},{"volume-title":"Proceedings of the 1st USENIX Conference on File and STorage Technologies.","author":"Chang F.","key":"e_1_2_1_10_1","unstructured":"Chang , F. , Ji , M. , Leung , S.-T. , Maccormick , J. , Perl , S. , and Zhang , L . 2002. Myraid: Cost-effective disaster tolerance . In Proceedings of the 1st USENIX Conference on File and STorage Technologies. Chang, F., Ji, M., Leung, S.-T., Maccormick, J., Perl, S., and Zhang, L. 2002. Myraid: Cost-effective disaster tolerance. In Proceedings of the 1st USENIX Conference on File and STorage Technologies."},{"volume-title":"Proceedings of the 3rd Symposium on Networked System Design and Implementation (NSDI).","author":"Chun B.-G.","key":"e_1_2_1_11_1","unstructured":"Chun , B.-G. , Dabek , F. , Haeberlen , Sit, E., Weatherspoon , H. , Kaashoek , M. F. , and Morris , R . 2006. Efficient replica maintenance for distributed storage systems . In Proceedings of the 3rd Symposium on Networked System Design and Implementation (NSDI). Chun, B.-G., Dabek , F., Haeberlen, Sit, E., Weatherspoon, H., Kaashoek, M. F., and Morris, R. 2006. Efficient replica maintenance for distributed storage systems. In Proceedings of the 3rd Symposium on Networked System Design and Implementation (NSDI)."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the Workshop on Economics of Peer-to-Peer Systems.","author":"Cohen B.","year":"2002","unstructured":"Cohen , B. 2002 . Incentives build robustness in bitTorrent . In Proceedings of the Workshop on Economics of Peer-to-Peer Systems. Cohen, B. 2002. Incentives build robustness in bitTorrent. In Proceedings of the Workshop on Economics of Peer-to-Peer Systems."},{"volume-title":"Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI).","author":"Cox L. P.","key":"e_1_2_1_13_1","unstructured":"Cox , L. P. , Murrary , C. , and Noble , B . 2002. Pastiche: Making backup cheap and easy . In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI). Cox, L. P., Murrary, C., and Noble, B. 2002. Pastiche: Making backup cheap and easy. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945458"},{"key":"e_1_2_1_15_1","unstructured":"Crashplan. Crashplan: Automatic offsite backup. http:\/\/www.crashplan.com\/\/.  Crashplan. Crashplan: Automatic offsite backup. http:\/\/www.crashplan.com\/\/."},{"volume-title":"Proceedings of the 1st ACM Symposium on Networked Systems Design and Implementation (NSDI).","author":"Dabek F.","key":"e_1_2_1_16_1","unstructured":"Dabek , F. , Kaashoek , M. F. , Li , J. , Morris , R. , Robertson , J. , and Sit , E . 2004. Designing a DHT for low latency and high throughput . In Proceedings of the 1st ACM Symposium on Networked Systems Design and Implementation (NSDI). Dabek, F., Kaashoek, M. F., Li, J., Morris, R., Robertson, J., and Sit, E. 2004. Designing a DHT for low latency and high throughput. In Proceedings of the 1st ACM Symposium on Networked Systems Design and Implementation (NSDI)."},{"key":"e_1_2_1_17_1","unstructured":"Ellison C. Frantz B. Lampson B. Rivest R. Thomas B. and Ylonen T. 1986. Spki certificate theory. Internet RFC 2693 http:\/\/www.cis.ohio-state.edu\/htbin\/rfc\/rfc2693.html.   Ellison C. Frantz B. Lampson B. Rivest R. Thomas B. and Ylonen T. 1986. Spki certificate theory. Internet RFC 2693 http:\/\/www.cis.ohio-state.edu\/htbin\/rfc\/rfc2693.html."},{"volume-title":"Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI).","author":"Ford B.","key":"e_1_2_1_18_1","unstructured":"Ford , B. , Strauss , J. , Lesniewski-Laas , C. , Rhea , S. , Kaashoek , F. , and Morris , R . 2006. Persistent personal names for globally connected mobile devices . In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI). Ford, B., Strauss, J., Lesniewski-Laas, C., Rhea, S., Kaashoek, F., and Morris, R. 2006. Persistent personal names for globally connected mobile devices. In Proceedings of the Symposium on Operating Systems Design and Implementation (OSDI)."},{"volume-title":"Proceedings of the 19th ACM Symposium on Operating System Principles (SOSP).","author":"Fu Y.","key":"e_1_2_1_19_1","unstructured":"Fu , Y. , Chase , J. S. , Chun , B. , Schwab , S. , and Vahdat , A . 2003 . In Proceedings of the 19th ACM Symposium on Operating System Principles (SOSP). Fu,Y., Chase, J. S., Chun, B., Schwab, S., and Vahdat, A. 2003. In Proceedings of the 19th ACM Symposium on Operating System Principles (SOSP)."},{"volume-title":"Proceedings of the 3rd Symposium on Networked System Design and Implementation (NSDI).","author":"Garriss S.","key":"e_1_2_1_20_1","unstructured":"Garriss , S. , Kaminsky , M. , Fredman , M. J. , Karp , B. , Mazires , D. , and Yu , H . 2006. Re: reliable email . In Proceedings of the 3rd Symposium on Networked System Design and Implementation (NSDI). Garriss, S., Kaminsky, M., Fredman, M. J., Karp, B., Mazires, D., and Yu, H. 2006. Re: reliable email. In Proceedings of the 3rd Symposium on Networked System Design and Implementation (NSDI)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1993.1002"},{"volume-title":"Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI).","author":"Haeberlen A.","key":"e_1_2_1_22_1","unstructured":"Haeberlen , A. , Mislove , A. , and Druschel , P . 2005. Glacier: Highly durable, decentralized storage despite massive correlated failures . In Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI). Haeberlen, A., Mislove, A., and Druschel, P. 2005. Glacier: Highly durable, decentralized storage despite massive correlated failures. In Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI)."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/988772.988811"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282380.1282396"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775242"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference.","author":"Kotla R.","key":"e_1_2_1_26_1","unstructured":"Kotla , R. , Alvisi , L. , and Dahlin , M . 2007. Safestore: A durable and practical storage system . In Proceedings of the USENIX Annual Technical Conference. Kotla, R., Alvisi, L., and Dahlin, M. 2007. Safestore: A durable and practical storage system. In Proceedings of the USENIX Annual Technical Conference."},{"volume-title":"Proceedings of the IEEE Symposium on Security and Privacy.","author":"Krohn M.","key":"e_1_2_1_27_1","unstructured":"Krohn , M. , Freedman , M. , and Mazires , D . 2004. On-the-fiy verification of rateless erasure codes for efficient content distribution . In Proceedings of the IEEE Symposium on Security and Privacy. Krohn, M., Freedman, M., and Mazires, D. 2004. On-the-fiy verification of rateless erasure codes for efficient content distribution. In Proceedings of the IEEE Symposium on Security and Privacy."},{"volume-title":"Proceedings of USENIX Operating Systems Design and Implementation (OSDI).","author":"Li H.","key":"e_1_2_1_28_1","unstructured":"Li , H. , Clement , A. , Wong , E. , Napper , J. , Roy , I. , Alvisi , L. , and Dahlin , M . 2006. BAR gossip . In Proceedings of USENIX Operating Systems Design and Implementation (OSDI). Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., and Dahlin, M. 2006. BAR gossip. In Proceedings of USENIX Operating Systems Design and Implementation (OSDI)."},{"volume-title":"Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS).","author":"Li J.","key":"e_1_2_1_29_1","unstructured":"Li , J. and Dabek , F . 2006. F2f: reliable storage in open networks . In Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS). Li, J. and Dabek, F. 2006. F2f: reliable storage in open networks. In Proceedings of the 4th International Workshop on Peer-to-Peer Systems (IPTPS)."},{"volume-title":"Proceedings of the USENIX Annual Technical Conference.","author":"Lillibridge M.","key":"e_1_2_1_30_1","unstructured":"Lillibridge , M. , Elnikety , S. , Birrel , A. , and Burrows , M . 2003. A cooperative Internet backup scheme . In Proceedings of the USENIX Annual Technical Conference. Lillibridge, M., Elnikety, S., Birrel, A., and Burrows, M. 2003. A cooperative Internet backup scheme. In Proceedings of the USENIX Annual Technical Conference."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047915.1047917"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30183-7_10"},{"volume-title":"Proceedings of the 5th Workshop on Hot Topics in Networks (HotNets).","author":"Mislove A.","key":"e_1_2_1_33_1","unstructured":"Mislove , A. , Gummadi , K. P. , and Druschel , P . 2006. Exploiting social networks for Internet search . In Proceedings of the 5th Workshop on Hot Topics in Networks (HotNets). Mislove, A., Gummadi, K. P., and Druschel, P. 2006. Exploiting social networks for Internet search. In Proceedings of the 5th Workshop on Hot Topics in Networks (HotNets)."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502052"},{"volume-title":"Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS).","author":"Ngan T.-W.","key":"e_1_2_1_36_1","unstructured":"Ngan , T.-W. , Wallach , D. , and Druschel , P . 2003. Enforcing fair sharing of peer-to-peer resources . In Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS). Ngan, T.-W., Wallach, D., and Druschel, P. 2003. Enforcing fair sharing of peer-to-peer resources. In Proceedings of the 5th International Workshop on Peer-to-Peer Systems (IPTPS)."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"volume-title":"Proceedings of the 5th Usenix Conference on File and Storage Technologies (FAST).","author":"Pinheiro E.","key":"e_1_2_1_38_1","unstructured":"Pinheiro , E. , Weber , W.-D. , and Barroso , L. A . 2007. Failure trends in a large disk drive population . In Proceedings of the 5th Usenix Conference on File and Storage Technologies (FAST). Pinheiro, E., Weber, W.-D., and Barroso, L. A. 2007. Failure trends in a large disk drive population. In Proceedings of the 5th Usenix Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2005.86"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/11861386_24"},{"volume-title":"Proceedings of the 25th IEEE Conference on Computer Communications (INFOCOM).","author":"Ramabhadran S.","key":"e_1_2_1_41_1","unstructured":"Ramabhadran , S. and Pasquale , J . 2006. Analysis of long-running replicated systems . In Proceedings of the 25th IEEE Conference on Computer Communications (INFOCOM). Ramabhadran, S. and Pasquale, J. 2006. Analysis of long-running replicated systems. In Proceedings of the 25th IEEE Conference on Computer Communications (INFOCOM)."},{"volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies.","author":"Rhea S.","key":"e_1_2_1_42_1","unstructured":"Rhea , S. , Eaton , P. , Geels , D. , Weatherspoon , H. , Zhao , B. , and Kubiatowicz , J . 2003. Pond: The oceanstore prototype . In Proceedings of the USENIX Conference on File and Storage Technologies. Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., and Kubiatowicz, J. 2003. Pond: The oceanstore prototype. In Proceedings of the USENIX Conference on File and Storage Technologies."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080102"},{"volume-title":"Proceedings of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware).","author":"Rowstron A.","key":"e_1_2_1_44_1","unstructured":"Rowstron , A. and Druschel , P . 2001a. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems . In Proceedings of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware). Rowstron, A. and Druschel, P. 2001a. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware)."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502053"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/844331.844337"},{"key":"e_1_2_1_47_1","unstructured":"Schroeder B. and Gibson G. 2007. Disk failures in the real world: What does an MTTF of 1 000 000 hours mean too you&quest; In Proceedings of the 5th Usenix Conference on File and Storage Technologies (FAST).   Schroeder B. and Gibson G. 2007. Disk failures in the real world: What does an MTTF of 1 000 000 hours mean too you&quest; In Proceedings of the 5th Usenix Conference on File and Storage Technologies (FAST)."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273008"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference. 142--156","author":"Storer M. W.","key":"e_1_2_1_49_1","unstructured":"Storer , M. W. , Greenan , K. M. , Miller , E. L. , and Voruganti , K . 2007. Potshards: Secure long-term storage without encryption . In Proceedings of the USENIX Annual Technical Conference. 142--156 . Storer, M. W., Greenan, K. M., Miller, E. L., and Voruganti, K. 2007. Potshards: Secure long-term storage without encryption. In Proceedings of the USENIX Annual Technical Conference. 142--156."},{"volume-title":"Proceedings of the 5th International Workshop on Peer-to-peer systems (IPTPS).","author":"Tati K.","key":"e_1_2_1_50_1","unstructured":"Tati , K. and Voelker , G . 2006. On object maintenance in peer-to-peer systems . In Proceedings of the 5th International Workshop on Peer-to-peer systems (IPTPS). Tati, K. and Voelker, G. 2006. On object maintenance in peer-to-peer systems. In Proceedings of the 5th International Workshop on Peer-to-peer systems (IPTPS)."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.03.050"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1435497.1435504"},{"volume-title":"Proceedings of USENIX WORLDS.","author":"Yang M.","key":"e_1_2_1_53_1","unstructured":"Yang , M. , Chen , H. , Zhao , B. Y. , Dai , Y. , and Zhang , Z . 2004. Deployment of a large-scale peer-to-peer social network . In Proceedings of USENIX WORLDS. Yang, M., Chen, H., Zhao, B. Y., Dai, Y., and Zhang, Z. 2004. Deployment of a large-scale peer-to-peer social network. In Proceedings of USENIX WORLDS."}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339118.2339119","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339118.2339119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:08Z","timestamp":1750238468000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339118.2339119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1145\/2339118.2339119"],"URL":"https:\/\/doi.org\/10.1145\/2339118.2339119","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2012,9]]},"assertion":[{"value":"2010-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-09-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}