{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T23:06:57Z","timestamp":1764112017663,"version":"3.46.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486142"},{"type":"electronic","value":"9783031486159"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-48615-9_15","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"411-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synchronizable Fair Exchange"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-2128-1734","authenticated-orcid":false,"given":"Ranjit","family":"Kumaresan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6737-6991","authenticated-orcid":false,"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3860-223X","authenticated-orcid":false,"given":"Adam","family":"Sealfon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Fair two-party computations via bitcoin deposits. In: B\u00f6hme, R., Brenner, M., Moore, T., Smith, M. (eds.) Financial Cryptography and Data Security - FC 2014 Workshops, BITCOIN and WAHC 2014, Christ Church, Barbados, 7 March 2014, Revised Selected Papers. LNCS, vol. 8438, pp. 105\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-662-44774-1_8","DOI":"10.1007\/978-3-662-44774-1_8"},{"issue":"4","key":"15_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/2896386","volume":"59","author":"M Andrychowicz","year":"2016","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. Commun. ACM 59(4), 76\u201384 (2016)","journal-title":"Commun. ACM"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Asharov, G.: Towards characterizing complete fairness in secure two-party computation. In: Lindell, Y. (ed.) Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, 24\u201326 February 2014, Proceedings. LNCS, vol. 8349, pp. 291\u2013316. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_13","DOI":"10.1007\/978-3-642-54242-8_13"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Asharov, G., Beimel, A., Makriyannis, N., Omri, E.: Complete characterization of fairness in secure two-party computation of boolean functions. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, 23\u201325 March 2015, Proceedings, Part I. LNCS, vol. 9014, pp. 199\u2013228. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_10","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: CCS 1997, Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, 1\u20134 April 1997, pp. 7\u201317 (1997)","DOI":"10.1145\/266420.266426"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE J. Sel. Areas Commun. 18(4), 593\u2013610 (2000)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, Chicago, Illinois, USA, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology - CRYPTO 2014\u201334th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2014, Proceedings, Part II. LNCS, vol. 8617, pp. 421\u2013439. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) Advances in Cryptology - CRYPTO 2000, 20th Annual International Cryptology Conference, Santa Barbara, California, USA, 20\u201324 August 2000, Proceedings. LNCS, vol. 1880, pp. 236\u2013254. Springer, Cham (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15","DOI":"10.1007\/3-540-44598-6_15"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, 19\u201323 August 2001, Proceedings. LNCS, vol. 2139, pp. 19\u201340. Springer, Cham (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2","DOI":"10.1007\/3-540-44647-8_2"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Canetti, R., Halevi, S., Katz, J.: Adaptively-secure, non-interactive public-key encryption. In: Kilian, J. (ed.) Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, 10\u201312 February 2005, Proceedings. LNCS, vol. 3378, pp. 150\u2013168. Springer, Cham (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_9","DOI":"10.1007\/978-3-540-30576-7_9"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, Chicago, Illinois, USA, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Green, M., Jain, A., Kaptchuk, G., Miers, I.: Fairness in an unfair world: fair multiparty computation from public bulletin boards. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, 30 October\u20133 November 2017, pp. 719\u2013728 (2017)","DOI":"10.1145\/3133956.3134092"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 28\u201330 May 1986, Berkeley, California, USA, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptology 30(4), 1157\u20131186 (2017)","journal-title":"J. Cryptology"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-004-0150-y","volume":"18","author":"M Fitzi","year":"2005","unstructured":"Fitzi, M., Garay, J.A., Maurer, U.M., Ostrovsky, R.: Minimal complete primitives for secure multi-party computation. J. Cryptology 18(1), 37\u201361 (2005)","journal-title":"J. Cryptology"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Jakobsson, M.: Timed release of standard digital signatures. In: Blaze, M. (ed.) Financial Cryptography, 6th International Conference, FC 2002, Southampton, Bermuda, 11\u201314 March 2002, Revised Papers. LNCS, vol. 2357, pp. 168\u2013182. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/3-540-36504-4_13","DOI":"10.1007\/3-540-36504-4_13"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s00145-010-9080-z","volume":"24","author":"JA Garay","year":"2011","unstructured":"Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. J. Cryptology 24(4), 615\u2013658 (2011)","journal-title":"J. Cryptology"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Pomerance, C.: Timed fair exchange of standard signatures: (extended abstract). In: Wright, R.N. (ed.) Financial Cryptography, 7th International Conference, FC 2003, Guadeloupe, French West Indies, 27\u201330 January 2003, Revised Papers. LNCS, vol. 2742, pp. 190\u2013207. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/978-3-540-45126-6_14","DOI":"10.1007\/978-3-540-45126-6_14"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM 58(6), 24:1\u201324:37 (2011)","DOI":"10.1145\/2049697.2049698"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Micciancio, D. (ed.) Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, 9\u201311 February 2010, Proceedings. LNCS, vol. 5978, pp. 91\u2013108. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_7","DOI":"10.1007\/978-3-642-11799-2_7"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, 15\u201317 March 2009, Proceedings. LNCS, vol. 5444, pp. 19\u201335. Springer, Cham (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_2","DOI":"10.1007\/978-3-642-00457-5_2"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Gilbert, H. (ed.) Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco\/French Riviera, 30 May\u20133 June 2010, Proceedings. LNCS, vol. 6110, pp. 157\u2013176. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_8","DOI":"10.1007\/978-3-642-13190-5_8"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Katz, J.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 11\u201320 (2007)","DOI":"10.1145\/1250790.1250793"},{"key":"15_CR28","unstructured":"Kumaresan, R., Raghuraman, S., Sealfon, A.: Synchronizable exchange. IACR Cryptol. ePrint Arch. 976 (2020)"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Kumaresan, R., Vaikuntanathan, V., Vasudevan, P.N.: Improvements to secure computation with penalties. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 406\u2013417 (2016)","DOI":"10.1145\/2976749.2978421"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John\u2019s, Newfoundland, Canada, 25\u201328 July 2004, pp. 1\u201310 (2004)","DOI":"10.1145\/1011767.1011769"},{"key":"15_CR31","doi-asserted-by":"publisher","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: Yung, M. (ed.) Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, 18\u201322 August 2002, Proceedings. LNCS, vol. 2442, pp. 111\u2013126. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_8","DOI":"10.1007\/3-540-45708-9_8"},{"key":"15_CR32","doi-asserted-by":"publisher","unstructured":"Pass, R., Shi, E., Tram\u00e8r, F.: Formal abstractions for attested execution secure processors. In: Coron, J.S., Nielsen, J. (eds.) Advances in Cryptology - EUROCRYPT 2017\u201336th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, 30 April\u20134 May 2017, Proceedings, Part I. LNCS, vol. 10210, pp. 260\u2013289. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_10","DOI":"10.1007\/978-3-319-56620-7_10"},{"key":"15_CR33","doi-asserted-by":"publisher","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) Advances in Cryptology - EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, 4\u20138 May 2003, Proceedings. LNCS, vol. 2656, pp. 87\u2013105. Springer, Cham (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_6","DOI":"10.1007\/3-540-39200-9_6"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 14\u201317 May 1989, Seattle, Washington, USA, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"15_CR35","first-page":"1655","volume":"2022","author":"S Raghuraman","year":"2022","unstructured":"Raghuraman, S., Yang, Y.: Just how fair is an unreactive world. IACR Cryptol. ePrint Arch. 2022, 1655 (2022)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"15_CR36","first-page":"178","volume":"2019","author":"R Sinha","year":"2019","unstructured":"Sinha, R., Gaddam, S., Kumaresan, R.: LucidiTEE: policy-based fair computing at scale. IACR Cryptol. ePrint Arch. 2019, 178 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October 1986, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48615-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T23:03:09Z","timestamp":1764111789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48615-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486142","9783031486159"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48615-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}