{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:54:06Z","timestamp":1755838446252,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerische Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["PZ00P-2142549,P2EZP2_155566"],"award-info":[{"award-number":["PZ00P-2142549,P2EZP2_155566"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1111599, 1223623, 1228890"],"award-info":[{"award-number":["1111599, 1223623, 1228890"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,21]]},"DOI":"10.1145\/2767386.2767431","type":"proceedings-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T13:28:49Z","timestamp":1437139729000},"page":"281-290","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["How Fair is Your Protocol?"],"prefix":"10.1145","author":[{"given":"Juan","family":"Garay","sequence":"first","affiliation":[{"name":"Yahoo Labs, Sunnyvale, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f6rn","family":"Tackmann","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Gilad\n      Asharov Ran\n      Canetti and \n      Carmit\n      Hazay\n    .\n  Towards a game theoretic view of secure computation\n  . In Kenneth G. Paterson editor EUROCRYPT \n  2011 volume \n  6632\n   of \n  LNCS pages \n  426\n  --\n  445 Heidelberg 2011. \n  Springer\n  .   Gilad Asharov Ran Canetti and Carmit Hazay. Towards a game theoretic view of secure computation. In Kenneth G. Paterson editor EUROCRYPT 2011 volume 6632 of LNCS pages 426--445 Heidelberg 2011. Springer.","DOI":"10.1007\/978-3-642-20465-4_24"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63520"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/357360.357368"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Dan\n      Boneh\n     and \n      Moni\n      Naor\n    .\n  Timed commitments\n  . In Mihir Bellare editor CRYPTO \n  2000 volume \n  1880\n   of \n  LNCS pages \n  236\n  --\n  254 Heidelberg 2000. \n  Springer\n  .   Dan Boneh and Moni Naor. Timed commitments. In Mihir Bellare editor CRYPTO 2000 volume 1880 of LNCS pages 236--254 Heidelberg 2000. Springer.","DOI":"10.1007\/3-540-44598-6_15"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.238015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00191356"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422482"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.75"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_21"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_25"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_7"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Benny\n      Pinkas\n    .\n  Fair secure two-party computation\n  . In Eli Biham editor EUROCRYPT \n  2003 volume \n  2656\n   of \n  LNCS pages \n  87\n  --\n  105 Heidelberg 2003. \n  Springer\n  .   Benny Pinkas. Fair secure two-party computation. In Eli Biham editor EUROCRYPT 2003 volume 2656 of LNCS pages 87--105 Heidelberg 2003. Springer.","DOI":"10.1007\/3-540-39200-9_6"}],"event":{"name":"PODC '15: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Donostia-San Sebasti\u00e1n Spain","acronym":"PODC '15"},"container-title":["Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767431","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767386.2767431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:06Z","timestamp":1750223226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767431"}},"subtitle":["A Utility-based Approach to Protocol Optimality"],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":20,"alternative-id":["10.1145\/2767386.2767431","10.1145\/2767386"],"URL":"https:\/\/doi.org\/10.1145\/2767386.2767431","relation":{},"subject":[],"published":{"date-parts":[[2015,7,21]]},"assertion":[{"value":"2015-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}