{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:29:06Z","timestamp":1770535746595,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["Safeware Grant W911NF-15-C-0213."],"award-info":[{"award-number":["Safeware Grant W911NF-15-C-0213."]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1010928,CNS-1228443, EFMA-1441209"],"award-info":[{"award-number":["CNS-1010928,CNS-1228443, EFMA-1441209"]}],"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":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134092","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"719-728","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["Fairness in an Unfair World"],"prefix":"10.1145","author":[{"given":"Arka Rai","family":"Choudhuri","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Matthew","family":"Green","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Gabriel","family":"Kaptchuk","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]},{"given":"Ian","family":"Miers","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Bar Alon and Eran Omri 2016. Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious TCC Part I. 307--335.","DOI":"10.1007\/978-3-662-53641-4_13"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.35"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov. 2014. Towards Characterizing Complete Fairness in Secure Two-Party Computation TCC. 291--316.","DOI":"10.1007\/978-3-642-54242-8_13"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Amos Beimel Nikolaos Makriyannis and Eran Omri 2015. Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions TCC Part I. 199--228.","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell and Tal Rabin. 2013. A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness TCC. 243--262.","DOI":"10.1007\/978-3-642-36594-2_14"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell and Hila Zarosim. 2013. Fair and Efficient Secure Multiparty Computation with Reputation Systems ASIACRYPT. 201--220.","DOI":"10.1007\/978-3-642-42045-0_11"},{"key":"e_1_3_2_2_7_1","volume-title":"Optimistic Protocols for Fair Exchange. In CCS '97, Proceedings of the 4th ACM Conference on Computer and Communications Security","author":"Asokan N.","year":"1997","unstructured":"N. Asokan, Matthias Schunter, and Michael Waidner. 1997. Optimistic Protocols for Fair Exchange. In CCS '97, Proceedings of the 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, April 1--4, 1997. 7--17."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"N. Asokan Victor Shoup and Michael Waidner 1998. Optimistic Fair Exchange of Digital Signatures (Extended Abstract) EUROCRYPT. 591--606.","DOI":"10.1007\/BFb0054156"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","unstructured":"Donald Beaver and Shafi Goldwasser 1989. Multiparty Computation with Faulty Majority. In CRYPTO. 589--590. 10.1109\/SFCS.1989.63520","DOI":"10.1109\/SFCS.1989.63520"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Amos Beimel Yehuda Lindell Eran Omri and Ilan Orlov. 2011. 1\/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds CRYPTO. 277--296.","DOI":"10.1007\/978-3-642-22792-9_16"},{"key":"e_1_3_2_2_11_1","volume-title":"Rivest","author":"Ben-Or Michael","year":"1985","unstructured":"Michael Ben-Or, Oded Goldreich, Silvio Micali, and Ronald L. Rivest 1985. A Fair Protocol for Signing Contracts (Extended Abstract) ICALP. 43--52."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53357-4_10"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","unstructured":"Iddo Bentov and Ranjit Kumaresan 2014. How to Use Bitcoin to Design Fair Protocols. In CRYPTO. 421--439. 10.1007\/978-3-662-44381-1_24","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh and Moni Naor 2000. Timed Commitments CRYPTO. 236--254.","DOI":"10.1007\/3-540-44598-6_15"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","unstructured":"Elette Boyle Kai-Min Chung and Rafael Pass. 2014. On Extractability Obfuscation. In TCC. 52--73. 10.1007\/978-3-642-54242-8_3","DOI":"10.1007\/978-3-642-54242-8_3"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","unstructured":"Christian Cachin and Jan Camenisch 2000. Optimistic Fair Secure Computation. In CRYPTO. 93--111. 10.1007\/3-540-44598-6_6","DOI":"10.1007\/3-540-44598-6_6"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"e_1_3_2_2_18_1","volume-title":"Practical UC security with a Global Random Oracle Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security","author":"Canetti Ran","year":"2014","unstructured":"Ran Canetti, Abhishek Jain, and Alessandra Scafuro. 2014. Practical UC security with a Global Random Oracle Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3--7, 2014. 597--608."},{"key":"e_1_3_2_2_19_1","volume-title":"May 19--21","author":"Canetti Ran","year":"2002","unstructured":"Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai 2002. Universally composable two-party and multi-party secure computation Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19--21, 2002, Montr\u00e9al, Qu\u00e9bec, Canada. 494--503."},{"key":"e_1_3_2_2_20_1","volume-title":"Paterson","author":"Chen Liqun","year":"2004","unstructured":"Liqun Chen, Caroline Kudla, and Kenneth G. Paterson. 2004. Concurrent Signatures EUROCRYPT. 287--305."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Richard Cleve. 1986. Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) STOC. 364--369.","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","unstructured":"Jean-S\u00e9bastien Coron Tancr\u00e8de Lepoint and Mehdi Tibouchi 2013. Practical Multilinear Maps over the Integers. In CRYPTO. 476--493. 10.1007\/978-3-642-40041-4_26","DOI":"10.1007\/978-3-642-40041-4_26"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Jean-S\u00e9bastien Coron Tancr\u00e8de Lepoint and Mehdi Tibouchi 2015. New Multilinear Maps Over the Integers. In CRYPTO. 267--286. 10.1007\/978-3-662-47989-6_13","DOI":"10.1007\/978-3-662-47989-6_13"},{"key":"e_1_3_2_2_24_1","volume-title":"18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23--27, 1998, Proceedings. 13--25","author":"Cramer Ronald","year":"1998","unstructured":"Ronald Cramer and Victor Shoup 1998. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23--27, 1998, Proceedings. 13--25."},{"key":"e_1_3_2_2_25_1","volume-title":"Smart","author":"Damgard Ivan","year":"2012","unstructured":"Ivan Damgard, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P. Smart. 2012. Practical Covertly Secure MPC for Dishonest Majority -- or: Breaking the SPDZ Limits. Cryptology ePrint Archive, Report 2012\/642. (2012). shownotehttp:\/\/eprint.iacr.org\/2012\/642."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_9"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"e_1_3_2_2_28_1","volume-title":"Garay and Markus Jakobsson","author":"Juan","year":"2002","unstructured":"Juan A. Garay and Markus Jakobsson 2002. Timed Release of Standard Digital Signatures. In Financial Cryptography. 168--182."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_29"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Juan A. Garay Philip D. MacKenzie Manoj Prabhakaran and Ke Yang 2006. Resource Fairness and Composability of Cryptographic Protocols TCC. 404--428.","DOI":"10.1007\/11681878_21"},{"key":"e_1_3_2_2_31_1","volume-title":"7th International Conference, FC 2003","author":"Juan","year":"2003","unstructured":"Juan A. Garay and Carl Pomerance 2003. Timed Fair Exchange of Standard Signatures: [Extended Abstract] Financial Cryptography, 7th International Conference, FC 2003, Guadeloupe, French West Indies, January 27--30, 2003, Revised Papers. 190--207."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","unstructured":"Sanjam Garg Craig Gentry and Shai Halevi. 2013. Candidate Multilinear Maps from Ideal Lattices. In EUROCRYPT. 1--17. 10.1007\/978-3-642-38348-9_1","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","unstructured":"Craig Gentry Sergey Gorbunov and Shai Halevi. 2015. Graph-Induced Multilinear Maps from Lattices. In TCC Part II. 498--527. 10.1007\/978-3-662-46497-7_20","DOI":"10.1007\/978-3-662-46497-7_20"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Allison B. Lewko and Brent Waters. 2014. Witness Encryption from Instance Independent Assumptions CRYPTO. 426--443.","DOI":"10.1007\/978-3-662-44371-2_24"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900010"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to play any mental game. In STOC. 10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_38_1","volume-title":"Levin","author":"Goldwasser Shafi","year":"1990","unstructured":"Shafi Goldwasser and Leonid A. Levin 1990. Fair Computation of General Functions in Presence of Immoral Majority CRYPTO. 77--93."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Shafi Goldwasser and Rafail Ostrovsky 1992. Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract). In CRYPTO. 228--245.","DOI":"10.1007\/3-540-48071-4_16"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"S. Dov Gordon Carmit Hazay Jonathan Katz and Yehuda Lindell 2008. Complete fairness in secure two-party computation. STOC. 413--422.","DOI":"10.1145\/1374376.1374436"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","unstructured":"S. Dov Gordon Yuval Ishai Tal Moran Rafail Ostrovsky and Amit Sahai 2010. On Complete Primitives for Fairness. In TCC. 91--108. 10.1007\/978-3-642-11799-2_7","DOI":"10.1007\/978-3-642-11799-2_7"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_2"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"S. Dov Gordon and Jonathan Katz 2010. Partial Fairness in Secure Two-Party Computation. EUROCRYPT. 157--176.","DOI":"10.1007\/978-3-642-13190-5_8"},{"key":"e_1_3_2_2_45_1","volume-title":"Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol CRYPTO '17","author":"Kiayias Aggelos","year":"2017","unstructured":"Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov 2017. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol CRYPTO '17."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010--9069--7"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--54970--4_11"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","unstructured":"Ranjit Kumaresan and Iddo Bentov 2016. Amortizing Secure Computation with Penalties. In ACM CCS. 418--429. 10.1145\/2976749.2978424","DOI":"10.1145\/2976749.2978424"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","unstructured":"Ranjit Kumaresan Tal Moran and Iddo Bentov. 2015. How to Use Bitcoin to Play Decentralized Poker. In ACM CCS. 195--206. 10.1145\/2810103.2813712","DOI":"10.1145\/2810103.2813712"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Alptekin K\u00fcpcc\u00fc and Anna Lysyanskaya 2010. Usable Optimistic Fair Exchange. In CT-RSA. 252--267.","DOI":"10.1007\/978-3-642-11925-5_18"},{"key":"e_1_3_2_2_51_1","article-title":"Legally Enforceable Fairness in Secure Two-Party Communication. Chicago","volume":"2009","author":"Lindell Yehuda","year":"2009","unstructured":"Yehuda Lindell. 2009. Legally Enforceable Fairness in Secure Two-Party Communication. Chicago J. Theor. Comput. Sci. Vol. 2009 (2009).","journal-title":"J. Theor. Comput. Sci."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Anna Lysyanskaya. 2002. Unique Signatures and Verifiable Random Functions from the DH-DDH Separation CRYPTO. 597--612.","DOI":"10.1007\/3-540-45708-9_38"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"Silvio Micali. 2003. Simple and fast optimistic protocols for fair electronic exchange PODC. 12--19.","DOI":"10.1145\/872035.872038"},{"key":"e_1_3_2_2_54_1","first-page":"1027","article-title":"Formal Abstractions for Attested Execution Secure Processors","volume":"2016","author":"Pass Rafael","year":"2016","unstructured":"Rafael Pass, Elaine Shi, and Florian Tram\u00e8r. 2016. Formal Abstractions for Attested Execution Secure Processors. IACR Cryptology ePrint Archive Vol. 2016 (2016), 1027. http:\/\/eprint.iacr.org\/2016\/1027","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Rafael Pass Elaine Shi and Florian Tram\u00e8r. 2017. Formal Abstractions for Attested Execution Secure Processors EUROCRYPT. 260--289.","DOI":"10.1007\/978-3-319-56620-7_10"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","unstructured":"Benny Pinkas. 2003. Fair Secure Two-Party Computation. In EUROCRYPT. 87--105. 10.1007\/3-540-39200-9_6","DOI":"10.1007\/3-540-39200-9_6"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Tal Rabin and Michael Ben-Or 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) STOC. 73--85.","DOI":"10.1145\/73007.73014"},{"key":"e_1_3_2_2_58_1","unstructured":"Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract) FOCS. 160--164. endthebibliography"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134092","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:03Z","timestamp":1750212663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134092"}},"subtitle":["Fair Multiparty Computation from Public Bulletin Boards"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":56,"alternative-id":["10.1145\/3133956.3134092","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134092","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}