{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T02:09:43Z","timestamp":1768874983676,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3363215","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"633-650","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure Computations"],"prefix":"10.1145","author":[{"given":"Ruiyu","family":"Zhu","sequence":"first","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changchang","family":"Ding","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Huang","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.35"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Ran Canetti and Carmit Hazay. 2011. Towards a game theoretic view of secure computation. In EUROCRYPT.  Gilad Asharov Ran Canetti and Carmit Hazay. 2011. Towards a game theoretic view of secure computation. In EUROCRYPT.","DOI":"10.1007\/978-3-642-20465-4_24"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell Thomas Schneider and Michael Zohner. 2015. More efficient oblivious transfer extensions with security for malicious adversaries. In EUROCRYPT.  Gilad Asharov Yehuda Lindell Thomas Schneider and Michael Zohner. 2015. More efficient oblivious transfer extensions with security for malicious adversaries. In EUROCRYPT.","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov and Claudio Orlandi. 2012. Calling out cheaters: Covert security with public verifiability. In ASIACRYPT.  Gilad Asharov and Claudio Orlandi. 2012. Calling out cheaters: Covert security with public verifiability. In ASIACRYPT.","DOI":"10.1007\/978-3-642-34961-4_41"},{"key":"e_1_3_2_2_5_1","volume-title":"Security against covert adversaries: Efficient protocols for realistic adversaries. Journal of Cryptology","author":"Aumann Yonatan","year":"2010"},{"key":"e_1_3_2_2_6_1","unstructured":"Mihir Bellare Oded Goldreich and Shafi Goldwasser. 1994. Incremental cryptography: The case of hashing and signing. In CRYPTO.  Mihir Bellare Oded Goldreich and Shafi Goldwasser. 1994. Incremental cryptography: The case of hashing and signing. In CRYPTO."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_2_8_1","volume-title":"Viet Tung Hoang, and Phillip Rogaway","author":"Bellare Mihir","year":"2012"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Iddo Bentov and Ranjit Kumaresan. 2014. How to use bitcoin to design fair protocols. In CRYPTO.  Iddo Bentov and Ranjit Kumaresan. 2014. How to use bitcoin to design fair protocols. In CRYPTO.","DOI":"10.1007\/978-3-662-44381-1_24"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Iddo Bentov Ranjit Kumaresan and Andrew Miller. 2017. Instantaneous decentralized poker. In ASIACRYPT.  Iddo Bentov Ranjit Kumaresan and Andrew Miller. 2017. Instantaneous decentralized poker. In ASIACRYPT.","DOI":"10.1007\/978-3-319-70697-9_15"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti and Rafail Ostrovsky. 1999. Secure computation with honest-looking parties: What if nobody is truly honest?. In ACM STOC.  Ran Canetti and Rafail Ostrovsky. 1999. Secure computation with honest-looking parties: What if nobody is truly honest?. In ACM STOC.","DOI":"10.1145\/301250.301313"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Ben Riva and Guy N Rothblum. 2011. Practical delegation of computation using multiple servers. In ACM CCS.  Ran Canetti Ben Riva and Guy N Rothblum. 2011. Practical delegation of computation using multiple servers. In ACM CCS.","DOI":"10.1145\/2046707.2046759"},{"key":"e_1_3_2_2_13_1","volume-title":"Kaleidoscope: An Efficient Poker Protocol with Payment Distribution and Penalty Enforcement. IACR Cryptology ePrint Archive","author":"David Bernardo","year":"2017"},{"key":"e_1_3_2_2_14_1","volume-title":"Jesper Buus Nielsen, and Claudio Orlandi","author":"Frederiksen Tore Kasper","year":"2015"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer Jonathan Katz and David Naccache. 2010. Efficient rational secret sharing in standard communication networks. In TCC.  Georg Fuchsbauer Jonathan Katz and David Naccache. 2010. Efficient rational secret sharing in standard communication networks. In TCC.","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"e_1_3_2_2_16_1","volume-title":"Rational protocol design: Cryptography against incentive-driven adversaries","author":"Garay Juan"},{"key":"e_1_3_2_2_17_1","unstructured":"Vipul Goyal Payman Mohassel and Adam Smith. 2008. Efficient two party and multi party computation against covert adversaries. In EUROCRYPT.  Vipul Goyal Payman Mohassel and Adam Smith. 2008. Efficient two party and multi party computation against covert adversaries. In EUROCRYPT."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Shay Gueron Yehuda Lindell Ariel Nof and Benny Pinkas. 2015. Fast garbling of circuits under standard assumptions. In ACM CCS.  Shay Gueron Yehuda Lindell Ariel Nof and Benny Pinkas. 2015. Fast garbling of circuits under standard assumptions. In ACM CCS.","DOI":"10.1145\/2810103.2813619"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Joseph Halpern and Vanessa Teague. 2004. Rational secret sharing and multiparty computation. In ACM STOC.  Joseph Halpern and Vanessa Teague. 2004. Rational secret sharing and multiparty computation. In ACM STOC.","DOI":"10.1145\/1007352.1007447"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Cheng Hong Jonathan Katz Vladimir Kolesnikov Wen-jie Lu and Xiao Wang. 2019. Covert Security with Public Verifiability: Faster Leaner and Simpler. In EUROCRYPT.  Cheng Hong Jonathan Katz Vladimir Kolesnikov Wen-jie Lu and Xiao Wang. 2019. Covert Security with Public Verifiability: Faster Leaner and Simpler. In EUROCRYPT.","DOI":"10.1007\/978-3-030-17659-4_4"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending oblivious transfers efficiently. In CRYPTO.  Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. 2003. Extending oblivious transfers efficiently. In CRYPTO.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_22_1","volume-title":"USENIX Security Symposium.","author":"Kalodner Harry","year":"2018"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Jonathan Katz Samuel Ranellucci Mike Rosulek and Xiao Wang. 2018. Optimizing authenticated garbling for faster secure two-party computation. In CRYPTO.  Jonathan Katz Samuel Ranellucci Mike Rosulek and Xiao Wang. 2018. Optimizing authenticated garbling for faster secure two-party computation. In CRYPTO.","DOI":"10.1007\/978-3-319-96878-0_13"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively secure OT extension with optimal overhead. In CRYPTO.  Marcel Keller Emmanuela Orsini and Peter Scholl. 2015. Actively secure OT extension with optimal overhead. In CRYPTO.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Aggelos Kiayias Hong-Sheng Zhou and Vassilis Zikas. 2016. Fair and robust multi-party computation using a global transaction ledger. In EUROCRYPT.  Aggelos Kiayias Hong-Sheng Zhou and Vassilis Zikas. 2016. Fair and robust multi-party computation using a global transaction ledger. In EUROCRYPT.","DOI":"10.1007\/978-3-662-49896-5_25"},{"key":"e_1_3_2_2_26_1","unstructured":"Gillat Kol and Moni Naor. 2008. Games for exchanging information. In ACM STOC.  Gillat Kol and Moni Naor. 2008. Games for exchanging information. In ACM STOC."},{"key":"e_1_3_2_2_27_1","volume":"201","author":"Kolesnikov Vladimir","journal-title":"Alex J Malozemoff."},{"key":"e_1_3_2_2_28_1","volume-title":"Mike Rosulek, Ni Trieu, and Roberto Trifiletti.","author":"Kolesnikov Vladimir","year":"2017"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Ranjit Kumaresan and Iddo Bentov. 2014. How to use bitcoin to incentivize correct computations. In ACM CCS.  Ranjit Kumaresan and Iddo Bentov. 2014. How to use bitcoin to incentivize correct computations. In ACM CCS.","DOI":"10.1145\/2660267.2660380"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Ranjit Kumaresan and Iddo Bentov. 2016. Amortizing secure computation with penalties. In ACM CCS.  Ranjit Kumaresan and Iddo Bentov. 2016. Amortizing secure computation with penalties. In ACM CCS.","DOI":"10.1145\/2976749.2978424"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Ranjit Kumaresan Tal Moran and Iddo Bentov. 2015. How to use bitcoin to play decentralized poker. In ACM CCS.  Ranjit Kumaresan Tal Moran and Iddo Bentov. 2015. How to use bitcoin to play decentralized poker. In ACM CCS.","DOI":"10.1145\/2810103.2813712"},{"key":"e_1_3_2_2_32_1","volume-title":"Bitcoin: A Peer-to-Peer Electronic Cash System.","author":"Nakamoto Satoshi","year":"2008"},{"key":"e_1_3_2_2_33_1","unstructured":"Chris Peikert Vinod Vaikuntanathan and Brent Waters. 2008. A framework for efficient and composable oblivious transfer. In CRYPTO.  Chris Peikert Vinod Vaikuntanathan and Brent Waters. 2008. A framework for efficient and composable oblivious transfer. In CRYPTO."},{"key":"e_1_3_2_2_34_1","unstructured":"Stefan Tillich and Nigel Smart. 2016 (accessed May 11 2019). Circuits of Basic Functions Suitable For MPC and FHE. https:\/\/homes.esat.kuleuven.be\/ nsmart\/MPC\/.  Stefan Tillich and Nigel Smart. 2016 (accessed May 11 2019). Circuits of Basic Functions Suitable For MPC and FHE. https:\/\/homes.esat.kuleuven.be\/ nsmart\/MPC\/."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660327"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated garbling and efficient maliciously secure two-party computation. In ACM CCS.  Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated garbling and efficient maliciously secure two-party computation. In ACM CCS.","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_2_37_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper","author":"Gavin Wood","year":"2019"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Mike Rosulek and David Evans. 2015. Two halves make a whole. In EUROCRYPT.  Samee Zahur Mike Rosulek and David Evans. 2015. Two halves make a whole. In EUROCRYPT.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Ruiyu Zhu Darion Cassel Amr Sabry and Yan Huang. 2018. NANOPI: extreme-scale actively-secure multi-party computation. In ACM CCS.  Ruiyu Zhu Darion Cassel Amr Sabry and Yan Huang. 2018. NANOPI: extreme-scale actively-secure multi-party computation. In ACM CCS.","DOI":"10.1145\/3243734.3243850"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_19"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Ruiyu Zhu Yan Huang and Darion Cassel. 2017. Pool: scalable on-demand secure computation service against malicious adversaries. In ACM CCS.  Ruiyu Zhu Yan Huang and Darion Cassel. 2017. Pool: scalable on-demand secure computation service against malicious adversaries. In ACM CCS.","DOI":"10.1145\/3133956.3134070"},{"key":"e_1_3_2_2_42_1","unstructured":"Ruiyu Zhu Yan Huang Jonathan Katz and Abhi Shelat. 2016. The cut-and-choose game and its application to cryptographic protocols. In USENIX Security.  Ruiyu Zhu Yan Huang Jonathan Katz and Abhi Shelat. 2016. The cut-and-choose game and its application to cryptographic protocols. In USENIX Security."}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3363215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3363215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:33Z","timestamp":1750203873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3363215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":42,"alternative-id":["10.1145\/3319535.3363215","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3363215","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}