{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:37:06Z","timestamp":1725889026560},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319600796"},{"type":"electronic","value":"9783319600802"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60080-2_4","type":"book-chapter","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T10:40:06Z","timestamp":1496313606000},"page":"50-67","source":"Crossref","is-referenced-by-count":1,"title":["Building Regular Registers with Rational Malicious Servers and Anonymous Clients"],"prefix":"10.1007","author":[{"given":"Antonella","family":"Del Pozzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silvia","family":"Bonomi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Lazzeretti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Baldoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Halpern, J. Y. Distributed protocols for leader election: a game-theoretic perspective. In: DISC 2013, pp. 61\u201375 (2003)","DOI":"10.1007\/978-3-642-41527-2_5"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Ginzberg, Y., Feibish, S.L., Sulamy, M.: Distributed computing building blocks for rational agents. In: PODC 2014, pp. 406\u2013415 (2014)","DOI":"10.1145\/2611462.2611481"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.P., Porth, C.: BAR fault tolerance for cooperative services. In: ACM SIGOPS Operating Systems Review. ACM, pp. 45\u201358 (2005)","DOI":"10.1145\/1095810.1095816"},{"issue":"1","key":"4_CR4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"issue":"1","key":"4_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s004460050004","volume":"13","author":"RA Bazzi","year":"2000","unstructured":"Bazzi, R.A.: Synchronous Byzantine Quorum systems. Distrib. Comput. 13(1), 45\u201352 (2000)","journal-title":"Distrib. Comput."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s002360000040","volume":"37","author":"S Chaudhuri","year":"2000","unstructured":"Chaudhuri, S., Kosa, M.J., Welch, J.: One-write algorithms for multivalued regular and atomic registers. Acta Informatica 37, 161\u2013192 (2000)","journal-title":"Acta Informatica"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Clement, A., Li, H.C., Napper, J., Martin, J., Alvisi, L., Dahlin, M.: BAR primer. In: DSN, M. (ed.), pp. 287\u2013296 (2008)","DOI":"10.1109\/DSN.2008.4630097"},{"key":"4_CR8","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, pp. 358\u2013359 (2007)","DOI":"10.1145\/1281100.1281172"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Del Pozzo, A., Bonomi, S., Lazzeretti, R., Baldoni, R.: Building regular registers with rational malicious servers and anonymous clients \u2013 extended version (2017). Available online on arXiv","DOI":"10.1007\/978-3-319-60080-2_4"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Uniform consensus with homonyms and omission failures. In: ICDCN 2013, pp. 61\u2013175 (2013)","DOI":"10.1007\/978-3-642-35668-1_12"},{"key":"4_CR11","volume-title":"Game Theory","author":"D Fudenberg","year":"1991","unstructured":"Fudenberg, D., Tirole, J.: Game Theory. Massachusetts, Cambridge (1991)"},{"issue":"1","key":"4_CR12","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1145\/200836.200871","volume":"42","author":"S Haldar","year":"1995","unstructured":"Haldar, S., Vidyasankar, K.: Constructing 1-writer multireader multivalued atomic variables from regular variables. JACM 42(1), 186\u2013203 (1995)","journal-title":"JACM"},{"key":"4_CR13","unstructured":"Ieong, S., Shoham, Y.: Bayesian coalitional games. In: AAAI 2008, pp. 95\u2013100 (2008)"},{"key":"4_CR14","unstructured":"Li, H.C., Clement, A., Wong, E.L., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR gossip. In: OSDI 2006, pp. 191\u2013204 (2006)"},{"issue":"2","key":"4_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, part 1: models, part 2: algorirhms. Distrib. Comput. 1(2), 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"issue":"4","key":"4_CR16","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2063509.2063512","volume":"29","author":"P Mahajan","year":"2011","unstructured":"Mahajan, P., Setty, S., Lee, S., Clement, A., Alvisi, L., Dahlin, M., Walfish, M.: Depot : cloud storage with minimal trust. ACM TOCS 29(4), 12 (2011)","journal-title":"ACM TOCS"},{"issue":"4","key":"4_CR17","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.K.: Byzantine Quorum systems. Distrib. Comput. 11(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Martin J., Alvisi L., Dahlin M.: Small Byzantine Quorum systems. In: DSN 2002, pp. 374\u2013388 (2002)","DOI":"10.1109\/DSN.2002.1028922"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Martin J., Alvisi L., Dahlin M.: Minimal Byzantine storage. In: DISC (2002)","DOI":"10.1007\/3-540-36108-1_21"},{"issue":"4","key":"4_CR20","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"4_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/174652.174657","volume":"41","author":"AK Singh","year":"1994","unstructured":"Singh, A.K., Anderson, J.H., Gouda, M.: The Elusive atomic register. JACM 41(2), 331\u2013334 (1994)","journal-title":"JACM"},{"issue":"4","key":"4_CR22","first-page":"452","volume":"21","author":"P Sousa","year":"2010","unstructured":"Sousa, P., Bessani, A.N., Correia, M., Neves, N.F., Verissimo, P.: Highly available intrusion-tolerant services with proactive-reactive recovery. IEEE TPDS 21(4), 452\u2013465 (2010)","journal-title":"IEEE TPDS"},{"key":"4_CR23","unstructured":"The Tor project. https:\/\/www.torproject.org"},{"issue":"6","key":"4_CR24","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0020-0190(88)90175-5","volume":"28","author":"K Vidyasankar","year":"1988","unstructured":"Vidyasankar, K.: Converting Lamport\u2019s regular register to atomic register. IPL 28(6), 287\u2013290 (1988)","journal-title":"IPL"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Vityani, P., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: FOCS 1987, pp. 223\u2013243 (1987)","DOI":"10.1109\/SFCS.1987.23"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: PODC 1991, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"issue":"11","key":"4_CR27","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Comm. ACM 22(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Dolev, S., ElDefrawy, K., Lampkins, J., Ostrovsky, R., Yung, M.: Proactive secret sharing with a dishonest majority. In: SCN 2016, pp. 529\u2013548 (2016)","DOI":"10.1007\/978-3-319-44618-9_28"},{"key":"4_CR29","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damgard, I.B.: Secure Multiparty Computation. Cambridge University Press, New York (2015)"}],"container-title":["Lecture Notes in Computer Science","Cyber Security Cryptography and Machine Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60080-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T07:23:53Z","timestamp":1569396233000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60080-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600796","9783319600802"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60080-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}