{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:50:25Z","timestamp":1763499025011,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484806","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:27Z","timestamp":1636805127000},"page":"1961-1980","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A PKI-based Framework for Establishing Efficient MPC Channels"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Masny","sequence":"first","affiliation":[{"name":"VISA Research, Palo Alto, CA, USA"}]},{"given":"Gaven","family":"Watson","sequence":"additional","affiliation":[{"name":"VISA Research, Palo Alto, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"relic-toolkitD. F. Aranha C. P. L. Gouv\u00eaa T. Markmann R. S. Wahby and K. Liao. RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell Thomas Schneider and Michael Zohner. More efficient oblivious transfer extensions with security for malicious adversaries. In Elisabeth Oswald and Marc Fischlin editors EUROCRYPT 2015 Part I volume 9056 of LNCS pages 673--701. Springer Heidelberg April 2015.","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276854"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Fabrice Benhamouda and Huijia Lin. k-round multiparty computation from k-round oblivious transfer via garbled interactive circuits. In Jesper Buus Nielsen and Vincent Rijmen editors EUROCRYPT 2018 Part II volume 10821 of LNCS pages 500--532. Springer Heidelberg April \/ May 2018.","DOI":"10.1007\/978-3-319-78375-8_17"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare and Silvio Micali. Non-interactive oblivious transfer and applications. In Gilles Brassard editor CRYPTO'89 volume 435 of LNCS pages 547--557. Springer Heidelberg August 1990.","DOI":"10.1007\/0-387-34805-0_48"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Asaf Cohen and Yehuda Lindell. A simpler variant of universally composable security for standard multiparty computation. In Rosario Gennaro and Matthew J. B. Robshaw editors CRYPTO 2015 Part II volume 9216 of LNCS pages 3--22. Springer Heidelberg August 2015.","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Yevgeniy Dodis Rafael Pass and Shabsi Walfish. Universally composable security with global setup. In Salil P. Vadhan editor TCC 2007 volume 4392 of LNCS pages 61--85. Springer Heidelberg February 2007.","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti and Hugo Krawczyk. Universally composable notions of key exchange and secure channels. In Lars R. Knudsen editor EUROCRYPT 2002 volume 2332 of LNCS pages 337--351. Springer Heidelberg April \/ May 2002.","DOI":"10.1007\/3-540-46035-7_22"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti and Tal Rabin. Universal composition with joint state. In Dan Boneh editor CRYPTO 2003 volume 2729 of LNCS pages 265--281. Springer Heidelberg August 2003.","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Daniel Shahaf and Margarita Vald. Universally composable authentication and key-exchange with global PKI. In Chen-Mou Cheng Kai-Min Chung Giuseppe Persiano and Bo-Yin Yang editors PKC 2016 Part II volume 9615 of LNCS pages 265--296. Springer Heidelberg March 2016.","DOI":"10.1007\/978-3-662-49387-8_11"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Ran Canetti Pratik Sarkar and Xiao Wang. Efficient and round-optimal oblivious transfer and commitment with adaptive security. In Shiho Moriai and Huaxiong Wang editors ASIACRYPT 2020 Part III volume 12493 of LNCS pages 277--308. Springer Heidelberg December 2020.","DOI":"10.1007\/978-3-030-64840-4_10"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Claude Cr\u00e9peau Jeroen van de Graaf and Alain Tapp. Committed oblivious transfer and private multi-party computation. In Don Coppersmith editor CRYPTO'95 volume 963 of LNCS pages 110--123. Springer Heidelberg August 1995.","DOI":"10.1007\/3-540-44750-4_9"},{"key":"e_1_3_2_2_16_1","first-page":"205","volume-title":"A randomized protocol for signing contracts","author":"Even Shimon","year":"1982","unstructured":"Shimon Even, Oded Goldreich, and Abraham Lempel. A randomized protocol for signing contracts. In David Chaum, Ronald L. Rivest, and Alan T. Sherman, editors, CRYPTO'82, pages 205--210. Plenum Press, New York, USA, 1982."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.34"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Georg Fuchsbauer Eike Kiltz and Julian Loss. The algebraic group model and its applications. In Hovav Shacham and Alexandra Boldyreva editors CRYPTO 2018 Part II volume 10992 of LNCS pages 33--62. Springer Heidelberg August 2018.","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"e_1_3_2_2_19_1","unstructured":"Ziya Alper Genc c Vincenzo Iovino and Alfredo Rial. \u201cThe simplest protocol for oblivious transfer\u201d revisited. Cryptology ePrint Archive Report 2017\/370 2017. https:\/\/eprint.iacr.org\/2017\/370."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796557"},{"key":"e_1_3_2_2_21_1","first-page":"218","volume-title":"How to play any mental game or A completeness theorem for protocols with honest majority","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Alfred Aho, editor, 19th ACM STOC, pages 218--229. ACM Press, May 1987."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg and Akshayaram Srinivasan. Two-round multiparty secure computation from minimal assumptions. In Jesper Buus Nielsen and Vincent Rijmen editors EUROCRYPT 2018 Part II volume 10821 of LNCS pages 468--499. Springer Heidelberg April \/ May 2018.","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"e_1_3_2_2_23_1","unstructured":"Eduard Hauck and Julian Loss. Efficient and universally composable protocols for oblivious transfer from the CDH assumption. Cryptology ePrint Archive Report 2017\/1011 2017. https:\/\/eprint.iacr.org\/2017\/1011."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Joe Kilian Kobbi Nissim and Erez Petrank. Extending oblivious transfers efficiently. In Dan Boneh editor CRYPTO 2003 volume 2729 of LNCS pages 145--161. Springer Heidelberg August 2003.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"1]EC:IKOPS11Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky Manoj Prabhakaran and Amit Sahai. Efficient non-interactive secure computation. In Kenneth G. Paterson editor EUROCRYPT 2011 volume 6632 of LNCS pages 406--425. Springer Heidelberg May 2011.","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Manoj Prabhakaran and Amit Sahai. Founding cryptography on oblivious transfer - efficiently. In David Wagner editor CRYPTO 2008 volume 5157 of LNCS pages 572--591. Springer Heidelberg August 2008.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_2_27_1","first-page":"20","volume-title":"20th ACM STOC","author":"Kilian Joe","year":"1988","unstructured":"Joe Kilian. Founding cryptography on oblivious transfer. In 20th ACM STOC, pages 20--31. ACM Press, May 1988."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. Actively secure OT extension with optimal overhead. In Rosario Gennaro and Matthew J. B. Robshaw editors CRYPTO 2015 Part I volume 9215 of LNCS pages 724--741. Springer Heidelberg August 2015.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_29_1","first-page":"309","volume-title":"ACM CCS 2019","author":"Masny Daniel","year":"2019","unstructured":"Daniel Masny and Peter Rindal. Endemic oblivious transfer. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 309--326. ACM Press, November 2019."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417870"},{"key":"e_1_3_2_2_31_1","first-page":"682","volume":"2021","author":"McQuoid Ian","year":"2021","unstructured":"Ian McQuoid, Mike Rosulek, and Lawrence Roy. Batching base oblivious transfers. IACR Cryptol. ePrint Arch., 2021:682, 2021.","journal-title":"Print Arch."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Michele Orr\u00f9 Emmanuela Orsini and Peter Scholl. Actively secure 1-out-of-N OT extension with application to private set intersection. In Helena Handschuh editor CT-RSA 2017 volume 10159 of LNCS pages 381--396. Springer Heidelberg February 2017.","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"e_1_3_2_2_33_1","volume-title":"How to exchange secrets by oblivious transfer. Technical report","author":"Rabin Michael O.","year":"1981","unstructured":"Michael O. Rabin. How to exchange secrets by oblivious transfer. Technical report, Harvard University, 1981."},{"key":"e_1_3_2_2_34_1","volume-title":"The Transport Layer Security (TLS) Protocol Version 1.2. RFC","author":"Rescorla Eric","year":"2008","unstructured":"Eric Rescorla and Tim Dierks. The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246, August 2008."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8446"},{"key":"e_1_3_2_2_36_1","first-page":"160","volume-title":"23rd FOCS","author":"Chi-Chih Yao Andrew","year":"1982","unstructured":"Andrew Chi-Chih Yao. Protocols for secure computations (extended abstract). In 23rd FOCS, pages 160--164. IEEE Computer Society Press, November 1982."},{"key":"e_1_3_2_2_37_1","first-page":"162","volume-title":"27th FOCS","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao. How to generate and exchange secrets (extended abstract). In 27th FOCS, pages 162--167. IEEE Computer Society Press, October 1986."}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:46:25Z","timestamp":1763498785000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":37,"alternative-id":["10.1145\/3460120.3484806","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484806","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}