{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:55:53Z","timestamp":1725641753155},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258725"},{"type":"electronic","value":"9783642258732"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_27","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T15:16:34Z","timestamp":1323357394000},"page":"392-408","source":"Crossref","is-referenced-by-count":3,"title":["N-party BAR Transfer"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Vila\u00e7a","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Leit\u00e3o","sequence":"additional","affiliation":[]},{"given":"Miguel","family":"Correia","sequence":"additional","affiliation":[]},{"given":"Lu\u00eds","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Gonen, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: PODC 2006, Denver, USA, pp. 53\u201362 (July 2006)","DOI":"10.1145\/1146381.1146393"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Aiyer, S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: BAR fault tolerance for cooperative services. In: SOSP 2005, Brighton, United Kingdom, pp. 45\u201358 (October 2005)","DOI":"10.1145\/1095810.1095816"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, D.: Boinc: A system for public-resource computing and storage. In: GRID 2004, Pittsburgh, USA, pp. 4\u201310 (November 2004)","DOI":"10.1109\/GRID.2004.14"},{"issue":"11","key":"27_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"D. Anderson","year":"2002","unstructured":"Anderson, D., Cobb, J., Korpela, E., Lebofsky, M., Werthimer, D.: SETI@home: an experiment in public-resource computing. Communications of the ACM\u00a045(11), 56\u201361 (2002)","journal-title":"Communications of the ACM"},{"key":"27_CR5","volume-title":"The Evolution of Cooperation","author":"R. Axelrod","year":"1984","unstructured":"Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S1570-8667(03)00025-X","volume":"1","author":"R. Baldoni","year":"2003","unstructured":"Baldoni, R., Helary, J.-M., Raynal, M., Tanguy, L.: Consensus in Byzantine asynchronous systems. J. Discrete Algorithms\u00a01(2), 185\u2013210 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous Byzantine agreement with optimal resilience. In: STOC 1993, New York, USA, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M. Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems\u00a020(4), 398\u2013461 (2002)","journal-title":"ACM Transactions on Computer Systems"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Clement, A., Napper, J., Li, H., Martin, J.-P., Alvisi, L., Dahlin, M.: Theory of bar games. In: PODC 2007, Portland, USA, pp. 358\u2013359 (August 2007)","DOI":"10.1145\/1281100.1281172"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00446-004-0110-7","volume":"17","author":"M. Correia","year":"2005","unstructured":"Correia, M., Neves, N.F., Lung, L.C., Verissimo, P.: Low complexity Byzantine-resilient consensus. Distributed Computing\u00a017(3), 237\u2013249 (2005)","journal-title":"Distributed Computing"},{"issue":"4","key":"27_CR11","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.: Authenticated algorithms for Byzantine agreement. SIAM J. Comput.\u00a012(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. of ACM\u00a035, 288\u2013323 (1988)","journal-title":"J. of ACM"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","volume":"69","author":"K. Eliaz","year":"2002","unstructured":"Eliaz, K.: Fault tolerant implementation. Review of Economic Studies\u00a069(3), 589\u2013610 (2002)","journal-title":"Review of Economic Studies"},{"issue":"11","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1109\/12.177311","volume":"41","author":"P. Fraigniaud","year":"1992","unstructured":"Fraigniaud, P.: Asymptotically optimal broadcasting and gossiping in faulty hypercube multicomputers. IEEE Transactions on Computers\u00a041(11), 1410\u20131419 (1992)","journal-title":"IEEE Transactions on Computers"},{"issue":"3859","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1126\/science.162.3859.1243","volume":"162","author":"G. Hardin","year":"1968","unstructured":"Hardin, G.: The tragedy of the commons. Science\u00a0162(3859), 1243\u20131247 (1968)","journal-title":"Science"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Keidar, I., Melamed, R., Orda, A.: Equicast: Scalable multicast with selfish users. In: PODC 2006, pp. 63\u201371 (July 2006)","DOI":"10.1145\/1146381.1146394"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative Byzantine fault tolerance. In: SOSP 2007, Stevenson, USA, pp. 45\u201358 (October 2007)","DOI":"10.1145\/1294261.1294267"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. on Computer Systems\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Trans. on Computer Systems"},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04, 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"5","key":"27_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/71.282556","volume":"5","author":"S. Lee","year":"1994","unstructured":"Lee, S., Shin, K.G.: Interleaved all-to-all reliable broadcast on meshes and hypercubes. IEEE Transactions on Parallel and Distributed Systems\u00a05(5), 449\u2013458 (1994)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"27_CR21","unstructured":"Li, H., Clement, A., Marchetti, M., Kapritsos, M., Robison, L., Alvisi, L., Dahlin, M.: Flightpath: Obedience vs choice in cooperative services. In: OSDI 2008, San Diego, USA (December 2008)"},{"key":"27_CR22","unstructured":"Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR gossip. In: OSDI 2006, Seattle, USA, pp. 191\u2013204 (November 2006)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. In: STOC 1997, El Paso, USA, pp. 569\u2013578 (1997)","DOI":"10.1145\/258533.258650"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-36108-1_21","volume-title":"Distributed Computing","author":"J.P. Martin","year":"2002","unstructured":"Martin, J.P., Alvisi, L., Dahlin, M.: Minimal Byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 311\u2013325. Springer, Heidelberg (2002)"},{"key":"27_CR25","unstructured":"Martin, O., Ariel, R.: A Course in Game Theory. MIT Press (1994)"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-15763-9_41","volume-title":"Distributed Computing","author":"E.L. Wong","year":"2010","unstructured":"Wong, E.L., Leners, J.B., Alvisi, L.: It\u2019s on Me! The Benefit of Altruism in BAR Environments. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 406\u2013420. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25873-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T15:53:01Z","timestamp":1561045981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}