{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:50:43Z","timestamp":1743054643038,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505935"},{"type":"electronic","value":"9783031505942"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"vor","delay-in-days":11,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>\nWe present a multi-party exchange protocol that achieves optimal partial fairness even in the presence of a dishonest majority. We demonstrate how this protocol can be applied to any type of multi-party exchange scenario where the network topology is complete. When combined with standard secure multi-party computation techniques, our protocol enables SMPC with partial fairness when a dishonest majority is involved. Fairness optimality is proven in an abstract model which applies to all protocols based on the concept of concealing the point when the secrets are exchanged. Our protocol improves known results via the use of timed-release encryption and commutative blinding.<\/jats:p>","DOI":"10.1007\/978-3-031-50594-2_16","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"313-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimally-Fair Multi-party Exchange Without Trusted Parties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7360-0143","authenticated-orcid":false,"given":"Ivo","family":"Maffei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7557-3901","authenticated-orcid":false,"given":"A. W.","family":"Roscoe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-76888-3_21","volume-title":"On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops","author":"A Alcaide","year":"2007","unstructured":"Alcaide, A., Estevez-Tapiador, J.M., Hernandez-Castro, J.C., Ribagorda, A.: A multi-party rational exchange protocol. In: Meersman, R., Tari, Z., Herrero, P. (eds.) OTM 2007. LNCS, vol. 4805, pp. 42\u201343. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76888-3_21"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-44774-1_8","volume-title":"Financial Cryptography and Data Security","author":"M Andrychowicz","year":"2014","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, \u0141: Fair two-party computations via bitcoin deposits. In: B\u00f6hme, R., Brenner, M., Moore, T., Smith, M. (eds.) FC 2014. LNCS, vol. 8438, pp. 105\u2013121. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44774-1_8"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for multi-party fair exchange. IBM Research Division (1996)","DOI":"10.1145\/266420.266426"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00145-020-09354-z","volume":"33","author":"A Beimel","year":"2020","unstructured":"Beimel, A., Lindell, Y., Omri, E., Orlov, I.: $$\\frac{1}{p}$$-secure multiparty computation without an honest majority and the best of both worlds. J. Cryptol. 33(4), 1659\u20131731 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09354-z","journal-title":"J. Cryptol."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: A fair protocol for signing contracts. IEEE Trans. Inf. Theor. 36(1), 40\u201346 (1990). https:\/\/doi.org\/10.1109\/18.50372","journal-title":"IEEE Trans. Inf. Theor."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"D Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 236\u2013254. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_15"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 364\u2013369. Association for Computing Machinery, New York, NY, USA (1986). https:\/\/doi.org\/10.1145\/12130.12168","DOI":"10.1145\/12130.12168"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-030-90567-5_17","volume-title":"Information Security and Privacy","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Roscoe, A.W., Ryan, P.Y.A.: Partially-fair computation from timed-release encryption and oblivious transfer. In: Baek, J., Ruj, S. (eds.) ACISP 2021. LNCS, vol. 13083, pp. 330\u2013349. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90567-5_17"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"I Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved non-committing encryption schemes based on a general complexity assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 432\u2013450. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_27"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"IB Damg\u00e5rd","year":"1995","unstructured":"Damg\u00e5rd, I.B.: Practical and provably secure release of a secret and exchange of signatures. J. Cryptol. 8(4), 201\u2013222 (1995). https:\/\/doi.org\/10.1007\/BF00191356","journal-title":"J. Cryptol."},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Feng, B., Deng, R., Nguyen, K.Q., Varadharajan, V.: Multi-party fair exchange with an off-line trusted neutral party. In: Proceedings of the Tenth International Workshop on Database and Expert Systems Applications, DEXA 1999, pp. 858\u2013862 (1999). https:\/\/doi.org\/10.1109\/DEXA.1999.795294","DOI":"10.1109\/DEXA.1999.795294"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0055475","volume-title":"Financial Cryptography","author":"M Franklin","year":"1998","unstructured":"Franklin, M., Tsudik, G.: Secure group barter: multi-party fair exchange with semi-trusted neutral parties. In: Hirchfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 90\u2013102. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055475"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. Association for Computing Machinery, New York, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 2. Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511721656","DOI":"10.1017\/CBO9780511721656"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-13190-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 157\u2013176. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_8"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Jakobsson, M.: Flash mixing. In: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1999, pp. 83\u201389. Association for Computing Machinery, New York, NY, USA (1999). https:\/\/doi.org\/10.1145\/301308.301333","DOI":"10.1145\/301308.301333"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-662-54970-4_11","volume-title":"Financial Cryptography and Data Security","author":"H K\u0131l\u0131n\u00e7","year":"2017","unstructured":"K\u0131l\u0131n\u00e7, H., K\u00fcp\u00e7\u00fc, A.: Efficiently making secure two-party computation fair. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 188\u2013207. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_11"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-662-54970-4_12","volume-title":"Financial Cryptography and Data Security","author":"A K\u00fcp\u00e7\u00fc","year":"2017","unstructured":"K\u00fcp\u00e7\u00fc, A., Mohassel, P.: Fast optimistically fair cut-and-choose 2PC. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 208\u2013228. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_12"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Maffei, I., Roscoe, A.W.: Delay encryption by cubing (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.05594","DOI":"10.48550\/ARXIV.2205.05594"},{"key":"16_CR21","unstructured":"Pagnia, H., G\u00e4rtner, F.C.: On the impossibility of fair exchange without a trusted third party. Technical report, Darmstadt University of Technology (1999). https:\/\/www.cs.utexas.edu\/~shmat\/courses\/cs395t_fall04\/pagnia.pdf"},{"key":"16_CR22","unstructured":"Prabhakaran, M.M., Sahai, A.: Secure Multi-Party Computation. IOS Press (2013). https:\/\/ebookcentral.proquest.com\/lib\/oxford\/detail.action?docID=1137458"},{"key":"16_CR23","unstructured":"Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock Puzzles and Timed-release Crypto. Report, Massachusetts Institute of Technology (1996)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-319-71075-4_31","volume-title":"Security Protocols XXV","author":"AW Roscoe","year":"2017","unstructured":"Roscoe, A.W., Ryan, P.Y.A.: Auditable PAKEs: approaching fair exchange without a TTP. In: Stajano, F., Anderson, J., Christianson, B., Maty\u00e1\u0161, V. (eds.) Security Protocols 2017. LNCS, vol. 10476, pp. 278\u2013297. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71075-4_31"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50594-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:10:42Z","timestamp":1704964242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50594-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505935","9783031505942"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50594-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"478","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":"93","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":"19% - 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-4","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}