{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:05Z","timestamp":1750308665765,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["FP7-ICT-2007-1 project no. 216471"],"award-info":[{"award-number":["FP7-ICT-2007-1 project no. 216471"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2012,4]]},"abstract":"<jats:p>Efficiency of asynchronous optimistic fair exchange using trusted devices is studied. It is shown that three messages in the optimistic subprotocol are sufficient and necessary for exchanging idempotent items. When exchanging nonidempotent items, however, three messages in the optimistic subprotocol are sufficient only under the assumption that trusted devices have unbounded storage capacity. This assumption is often not satisfiable in practice. It is then proved that exchanging nonidempotent items using trusted devices with a bounded storage capacity requires exactly four messages in the optimistic subprotocol.<\/jats:p>","DOI":"10.1145\/2168260.2168263","type":"journal-article","created":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T13:43:38Z","timestamp":1335879818000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficiency of optimistic fair exchange using trusted devices"],"prefix":"10.1145","volume":"7","author":[{"given":"Mohammad Torabi","family":"Dashti","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Switzerland, Zuerich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,5,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"e_1_2_1_2_1","unstructured":"Asokan N. 1998. Fairness in electronic commerce. Ph.D. thesis University of Waterloo. Asokan N. 1998. Fairness in electronic commerce. Ph.D. thesis University of Waterloo."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01843569"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.841169"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_2_1_6_1","unstructured":"Even S. and Yacobi Y. 1980. Relations among public key signature systems. Tech. rep. 175 Computer Science Department Technion Haifa Isreal. Even S. and Yacobi Y. 1980. Relations among public key signature systems. Tech. rep. 175 Computer Science Department Technion Haifa Isreal."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2005.40"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Fagin R. Halpern J. Moses Y. and Vardi M. 1995. Reasoning About Knowledge. MIT Press Cambridge MA. Fagin R. Halpern J. Moses Y. and Vardi M. 1995. Reasoning About Knowledge. MIT Press Cambridge MA.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_3"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Francez N. 1986. Fairness. Springer. Francez N. 1986. Fairness. Springer.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Fujimura K. and Eastlake D. 2003. Requirements and design for voucher trading system (VTS). RFC 3506. Fujimura K. and Eastlake D. 2003. Requirements and design for voucher trading system (VTS). RFC 3506.","DOI":"10.17487\/rfc3506"},{"volume-title":"Proceedings of the USENIX Security '99 Conference. 229--240","author":"Fujimura K.","key":"e_1_2_1_12_1"},{"volume-title":"Operating Systems, An Advanced Course","series-title":"Lecture Notes in Computer Science","author":"Gray J.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","unstructured":"Guerraoui R. and Rodrigues L. 2006. Introduction to Reliable Distributed Programming. Springer. Guerraoui R. and Rodrigues L. 2006. Introduction to Reliable Distributed Programming. Springer."},{"volume":"232","volume-title":"Proceedings of the Information Security IFIP SEC'07 Conference. IFIP","author":"Kuntze N.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2009.15"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872038"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/46.1.55"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277717"},{"key":"e_1_2_1_20_1","unstructured":"Schunter M. 2000. Optimistic fair exchange. Ph.D. thesis Universit\u00e4t des Saarlandes. Schunter M. 2000. Optimistic fair exchange. Ph.D. thesis Universit\u00e4t des Saarlandes."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjdc.2.120"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Torabi Dashti M. and Mauw S. 2010. Handbook of Financial Cryptography and Security. G. Rosenberg Ed. Chapmand and Hall\/CRC 109--132. Torabi Dashti M. and Mauw S. 2010. Handbook of Financial Cryptography and Security. G. Rosenberg Ed. Chapmand and Hall\/CRC 109--132.","DOI":"10.1201\/9781420059823-c5"},{"key":"e_1_2_1_23_1","first-page":"393","article-title":"Nuovo DRM Paradiso: Designing a secure, verified, fair exchange DRM scheme","volume":"89","author":"Torabi Dashti M.","year":"2008","journal-title":"Fundam. Inf."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248054"},{"volume-title":"Financial Cryptography","series-title":"Lecture Notes in Computer Science","author":"Vogt H.","key":"e_1_2_1_25_1"},{"volume":"2232","volume-title":"Lecture Notes in Computer Science","author":"Vogt H.","key":"e_1_2_1_26_1"}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2168260.2168263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2168260.2168263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:33Z","timestamp":1750276833000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2168260.2168263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["10.1145\/2168260.2168263"],"URL":"https:\/\/doi.org\/10.1145\/2168260.2168263","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2012,4]]},"assertion":[{"value":"2010-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-05-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}