{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:00:10Z","timestamp":1773511210119,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"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"}],"funder":[{"name":"ERC Project NTSC","award":["742754"],"award-info":[{"award-number":["742754"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3363227","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"869-886","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs"],"prefix":"10.1145","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[{"name":"IDC Herzliya, Herzliya, Israel"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beer Sheva, Israel"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}]}],"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.2017.15"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978331"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243801"},{"key":"e_1_3_2_2_4_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4 , 1988, Chicago, Illinois, USA. 1--10. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA. 1--10."},{"key":"e_1_3_2_2_5_1","volume-title":"TCC2016-B","author":"Ben-Sasson Eli","year":"2016","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , and Nicholas Spooner . 2016 . Interactive Oracle Proofs. In Theory of Cryptography - 14th International Conference , TCC2016-B , Beijing, China, October 31 - November 3, 2016, Proceedings, Part II. 31--60. Eli Ben-Sasson, Alessandro Chiesa, and Nicholas Spooner. 2016. Interactive Oracle Proofs. In Theory of Cryptography - 14th International Conference, TCC2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II. 31--60."},{"key":"e_1_3_2_2_6_1","volume-title":"13thEuropean Symposium on Research in Computer Security, M\u00e1laga, Spain, October 6--8, 2008. Proceedings. 192--206","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov , Sven Laur , and Jan Willemson . 2008 . Sharemind: A Framework for Fast Privacy-Preserving Computations. In Computer Security - ESORICS 2008 , 13thEuropean Symposium on Research in Computer Security, M\u00e1laga, Spain, October 6--8, 2008. Proceedings. 192--206 . Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A Framework for Fast Privacy-Preserving Computations. In Computer Security - ESORICS 2008, 13thEuropean Symposium on Research in Computer Security, M\u00e1laga, Spain, October 6--8, 2008. Proceedings. 192--206."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243784"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_2_11_1","volume-title":"Dario Fiore, and Irene Giacomelli.","author":"Catalano Dario","year":"2019","unstructured":"Dario Catalano , Mario Di Raimondo , Dario Fiore, and Irene Giacomelli. 2019 .MonZ2ka: Fast Maliciously Secure Two Party Computation on Z2k. IACR Cryptology ePrint Archive 2019 (2019), 211. Dario Catalano, Mario Di Raimondo, Dario Fiore, and Irene Giacomelli. 2019.MonZ2ka: Fast Maliciously Secure Two Party Computation on Z2k. IACR Cryptology ePrint Archive2019 (2019), 211."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358922"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4","author":"Chaum David","year":"1988","unstructured":"David Chaum , Claude Cr\u00e9peau , and Ivan Damg\u00e5rd . 1988 . Multiparty Unconditionally Secure Protocols (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4 , 1988, Chicago, Illinois, USA.11--19. David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. 1988. Multiparty Unconditionally Secure Protocols (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA.11--19."},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings,Part III. 34--64","author":"Chida Koji","year":"2018","unstructured":"Koji Chida , Daniel Genkin , Koki Hamada , Dai Ikarashi , Ryo Kikuchi , Yehuda Lindell , and Ariel Nof . 2018 . Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2018 , Proceedings,Part III. 34--64 . Koji Chida, Daniel Genkin, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Yehuda Lindell, and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19--23, 2018, Proceedings,Part III. 34--64."},{"key":"e_1_3_2_2_15_1","volume-title":"Proceedings, Part II. 769--798","author":"Cramer Ronald","year":"2018","unstructured":"Ronald Cramer , Ivan Damg\u00e5rd , Daniel Escudero , Peter Scholl , and Chaoping Xing . 2018 . SPDZ2k: Efficient MPC mod 2k for Dishonest Majority. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference,Santa Barbara, CA, USA, August 19--23, 2018 , Proceedings, Part II. 769--798 . Ronald Cramer, Ivan Damg\u00e5rd, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018. SPDZ2k: Efficient MPC mod 2k for Dishonest Majority. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference,Santa Barbara, CA, USA, August 19--23, 2018, Proceedings, Part II. 769--798."},{"key":"e_1_3_2_2_16_1","volume-title":"Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005, Proceedings. 342--362","author":"Cramer Ronald","year":"2005","unstructured":"Ronald Cramer , Ivan Damg\u00e5rd , and Yuval Ishai . 2005 . Share Conversion, Pseudo-random Secret-Sharing and Applications to Secure Computation. In Theory of Cryptography , Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005, Proceedings. 342--362 . Ronald Cramer, Ivan Damg\u00e5rd, and Yuval Ishai. 2005. Share Conversion, Pseudo-random Secret-Sharing and Applications to Secure Computation. In Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005, Proceedings. 342--362."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_27"},{"key":"e_1_3_2_2_18_1","first-page":"164","article-title":"Use your Brain! Arithmetic 3PC For Any Modulus with Active Security","volume":"2019","author":"Eerikson Hendrik","year":"2019","unstructured":"Hendrik Eerikson , Claudio Orlandi , Pille Pullonen , Joonas Puura , and Mark Simkin . 2019 . Use your Brain! Arithmetic 3PC For Any Modulus with Active Security . IACR Cryptology ePrint Archive 2019 (2019), 164 . Hendrik Eerikson, Claudio Orlandi, Pille Pullonen, Joonas Puura, and Mark Simkin. 2019. Use your Brain! Arithmetic 3PC For Any Modulus with Active Security. IACR Cryptology ePrint Archive 2019 (2019), 164.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_19_1","volume-title":"Conference on the Theory and Application of Cryptographic Techniques. Springer, 186--194","author":"Fiat Amos","year":"1986","unstructured":"Amos Fiat and Adi Shamir . 1986 . How to prove yourself: Practical solutions to identification and signature problems . In Conference on the Theory and Application of Cryptographic Techniques. Springer, 186--194 . Amos Fiat and Adi Shamir. 1986. How to prove yourself: Practical solutions to identification and signature problems. In Conference on the Theory and Application of Cryptographic Techniques. Springer, 186--194."},{"key":"e_1_3_2_2_20_1","volume-title":"Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. IACR Cryptologye Print Archive2019","author":"Furukawa Jun","year":"2019","unstructured":"Jun Furukawa and Yehuda Lindell . 2019. Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. IACR Cryptologye Print Archive2019 ( 2019 ), 658. https:\/\/eprint.iacr.org\/2019\/658 To appear inCCS 2019. Jun Furukawa and Yehuda Lindell. 2019. Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. IACR Cryptologye Print Archive2019 (2019), 658. https:\/\/eprint.iacr.org\/2019\/658 To appear inCCS 2019."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_8"},{"key":"e_1_3_2_2_22_1","volume-title":"Compressing Cryptographic Resources. In Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15--19, 1999, Proceedings. 591--608","author":"Gilboa Niv","year":"1999","unstructured":"Niv Gilboa and Yuval Ishai . 1999 . Compressing Cryptographic Resources. In Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15--19, 1999, Proceedings. 591--608 . https:\/\/doi.org\/10.1007\/3--540--48405--1_37 10.1007\/3--540--48405--1_37 Niv Gilboa and Yuval Ishai. 1999. Compressing Cryptographic Resources. In Advances in Cryptology - CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15--19, 1999, Proceedings. 591--608. https:\/\/doi.org\/10.1007\/3--540--48405--1_37"},{"key":"e_1_3_2_2_23_1","volume-title":"Basic Applications","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2004. The Foundations of Cryptography - Volume 2 , Basic Applications . Cambridge University Press . Oded Goldreich. 2004.The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"Goldreich Oded","year":"1987","unstructured":"Oded Goldreich , Silvio Micali , and Avi Wigderson . 1987 . 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. 218--229. Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. 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. 218--229."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"S. Dov Gordon Samuel Ranellucci and Xiao Wang. 2018. Secure Computation with Low Communication from Cross-Checking. In Advances in Cryptology -ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security Brisbane QLD Australia December 2--6 2018 Proceedings Part III. 59--85.  S. Dov Gordon Samuel Ranellucci and Xiao Wang. 2018. Secure Computation with Low Communication from Cross-Checking. In Advances in Cryptology -ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security Brisbane QLD Australia December 2--6 2018 Proceedings Part III. 59--85.","DOI":"10.1007\/978-3-030-03332-3_3"},{"key":"e_1_3_2_2_27_1","volume-title":"Sarvar Patel, Mariana Raykova, Shobhit Saxena, Karn Seth, David Shanahan, and Moti Yung.","author":"Ion Mihaela","year":"2019","unstructured":"Mihaela Ion , Ben Kreuter , Ahmet Erhan Nergiz , Sarvar Patel, Mariana Raykova, Shobhit Saxena, Karn Seth, David Shanahan, and Moti Yung. 2019 . On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications. IACR Cryptology ePrint Archive 2019 (2019), 723. https:\/\/eprint.iacr.org\/2019\/723 Mihaela Ion, Ben Kreuter, Ahmet Erhan Nergiz, Sarvar Patel, Mariana Raykova, Shobhit Saxena, Karn Seth, David Shanahan, and Moti Yung. 2019. On Deploying Secure Computing Commercially: Private Intersection-Sum Protocols and their Business Applications. IACR Cryptology ePrint Archive2019 (2019), 723. https:\/\/eprint.iacr.org\/2019\/723"},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings, Part II. 359--378","author":"Ishai Yuval","year":"2015","unstructured":"Yuval Ishai , Ranjit Kumaresan , Eyal Kushilevitz , and Anat Paskin-Cherniavsky . 2015 . Secure Computation with Minimal Interaction, Revisited. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA,USA, August 16--20, 2015 , Proceedings, Part II. 359--378 . https:\/\/doi.org\/10.1007\/978--3--662--48000--7_18 10.1007\/978--3--662--48000--7_18 Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, and Anat Paskin-Cherniavsky. 2015. Secure Computation with Minimal Interaction, Revisited. In Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA,USA, August 16--20, 2015, Proceedings, Part II. 359--378. https:\/\/doi.org\/10.1007\/978--3--662--48000--7_18"},{"key":"e_1_3_2_2_29_1","volume-title":"Advances in Cryptology - CRYPTO2016 - 36th Annual International Cryptology Conference. 430--458.","author":"Ishai Yuval","unstructured":"Yuval Ishai , Eyal Kushilevitz , Manoj Prabhakaran , Amit Sahai , and Ching-Hua Yu. 2016. Secure Protocol Transformations . In Advances in Cryptology - CRYPTO2016 - 36th Annual International Cryptology Conference. 430--458. Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, and Ching-Hua Yu. 2016. Secure Protocol Transformations. In Advances in Cryptology - CRYPTO2016 - 36th Annual International Cryptology Conference. 430--458."},{"key":"e_1_3_2_2_30_1","volume-title":"Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science)72, 9","author":"Ito Mitsuru","year":"1989","unstructured":"Mitsuru Ito , Akira Saito , and Takao Nishizeki . 1989. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science)72, 9 ( 1989 ), 56--64. Mitsuru Ito, Akira Saito, and Takao Nishizeki. 1989. Secret sharing scheme realizing general access structure. Electronics and Communications in Japan (Part III: Fundamental Electronic Science)72, 9 (1989), 56--64."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243805"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.03.020"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813705"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_17"},{"key":"e_1_3_2_2_36_1","volume-title":"Reaching Agreement in the Presence of Faults.J. ACM27, 2","author":"Pease Marshall C.","year":"1980","unstructured":"Marshall C. Pease , Robert E. Shostak , and Leslie Lamport . 1980. Reaching Agreement in the Presence of Faults.J. ACM27, 2 ( 1980 ), 228--234. Marshall C. Pease, Robert E. Shostak, and Leslie Lamport. 1980. Reaching Agreement in the Presence of Faults.J. ACM27, 2 (1980), 228--234."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"e_1_3_2_2_38_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17","author":"Rabin Tal","year":"1989","unstructured":"Tal Rabin and Michael Ben-Or . 1989 . Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) . In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17 , 1989, Seattle, Washington, USA. 73--85. Tal Rabin and Michael Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14--17, 1989, Seattle, Washington, USA. 73--85."},{"key":"e_1_3_2_2_39_1","volume-title":"27th Annual Symposium on Foundations of Computer Science","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to Generate and Exchange Secrets (Extended Abstract) . In 27th Annual Symposium on Foundations of Computer Science , Toronto, Canada, 27- -29 October 1986. 162--167. Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets (Extended Abstract). In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27--29 October 1986. 162--167."}],"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.3363227","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3363227","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.3363227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":39,"alternative-id":["10.1145\/3319535.3363227","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3363227","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"}}]}}