{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T09:23:25Z","timestamp":1773912205879,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["N66001-15-C-4070 and FA8750-19-C-0502"],"award-info":[{"award-number":["N66001-15-C-4070 and FA8750-19-C-0502"]}]},{"DOI":"10.13039\/100011039","name":"Intelligence Advanced Research Projects Activity","doi-asserted-by":"publisher","award":["2019-1902070006"],"award-info":[{"award-number":["2019-1902070006"]}],"id":[{"id":"10.13039\/100011039","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ERC","award":["ERC-2015-AdG-IMPaCT"],"award-info":[{"award-number":["ERC-2015-AdG-IMPaCT"]}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["GOH9718N"],"award-info":[{"award-number":["GOH9718N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,11]]},"DOI":"10.1145\/3338469.3358943","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T19:43:22Z","timestamp":1573155802000},"page":"33-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Zaphod"],"prefix":"10.1145","author":[{"given":"Abdelrahaman","family":"Aly","sequence":"first","affiliation":[{"name":"KU Leuven, Leuven, Belgium"}]},{"given":"Emmanuela","family":"Orsini","sequence":"additional","affiliation":[{"name":"KU Leuven, Leuven, Belgium"}]},{"given":"Dragos","family":"Rotaru","sequence":"additional","affiliation":[{"name":"KU Leuven & University of Bristol, Leuven, Belgium"}]},{"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[{"name":"KU Leuven & University of Bristol, Leuven, Belgium"}]},{"given":"Tim","family":"Wood","sequence":"additional","affiliation":[{"name":"KU Leuven & University of Bristol, Leuven, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Smart, and Tim Wood","author":"Aly Abdelrahaman","year":"2018","unstructured":"Abdelrahaman Aly , Marcel Keller , Emmanuela Orsini , Dragos Rotaru , Peter Scholl , Nigel P. Smart, and Tim Wood . 2018 . SCALE-MAMBA v1.2: Documentation .https:\/\/homes.esat.kuleuven.be\/~nsmart\/SCALE\/Documentation.pdf Abdelrahaman Aly, Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl,Nigel P. Smart, and Tim Wood. 2018. SCALE-MAMBA v1.2: Documentation.https:\/\/homes.esat.kuleuven.be\/~nsmart\/SCALE\/Documentation.pdf"},{"key":"e_1_3_2_1_2_1","volume-title":"Smart","author":"Baum Carsten","year":"2019","unstructured":"Carsten Baum , Daniele Cozzo , and Nigel P . Smart . 2019 . Using Top Gear in Overdrive : A more efficient ZKPoK for SPDZ. IACR Cryptology ePrint Archive 2019 (2019), 35. https:\/\/eprint.iacr.org\/2019\/035 Carsten Baum, Daniele Cozzo, and Nigel P. Smart. 2019. Using Top Gear in Overdrive: A more efficient ZKPoK for SPDZ. IACR Cryptology ePrint Archive2019 (2019), 35. https:\/\/eprint.iacr.org\/2019\/035"},{"key":"e_1_3_2_1_3_1","volume-title":"In22nd Annual ACM Symposium on Theory of Computing. ACM Press","author":"Beaver Donald","year":"1990","unstructured":"Donald Beaver , Silvio Micali , and Phillip Rogaway . 1990 . The Round Complexity of Secure Protocols (Extended Abstract) . In22nd Annual ACM Symposium on Theory of Computing. ACM Press , Baltimore, MD, USA, 503--513. https:\/\/doi.org\/10.1145\/100216.100287 10.1145\/100216.100287 Donald Beaver, Silvio Micali, and Phillip Rogaway. 1990. The Round Complexity of Secure Protocols (Extended Abstract). In22nd Annual ACM Symposium on Theory of Computing. ACM Press, Baltimore, MD, USA, 503--513. https:\/\/doi.org\/10.1145\/100216.100287"},{"key":"e_1_3_2_1_4_1","volume-title":"20th Annual ACM Symposium on Theory of Computing. ACM Press","author":"Ben-Or Michael","year":"1988","unstructured":"Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness The-orems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) . In 20th Annual ACM Symposium on Theory of Computing. ACM Press , Chicago, IL, USA, 1--10. https:\/\/doi.org\/10.1145\/62212.62213 10.1145\/62212.62213 Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness The-orems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In 20th Annual ACM Symposium on Theory of Computing. ACM Press, Chicago, IL, USA, 1--10. https:\/\/doi.org\/10.1145\/62212.62213"},{"key":"e_1_3_2_1_5_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science), Kenneth G","author":"Bendlin Rikke","year":"2046","unstructured":"Rikke Bendlin , Ivan Damg\u00e5rd , Claudio Orlandi , and Sarah Zakarias . 2011. Semi-homomorphic Encryption and Multiparty Computation . In Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science), Kenneth G . Paterson (Ed.), Vol. 6632 . Springer , Heidelberg, Germany , Tallinn, Estonia, 169--188.https:\/\/doi.org\/10.1007\/978-3-642- 2046 5-4_11 10.1007\/978-3-642-20465-4_11 Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In Advances in Cryptology -- EUROCRYPT 2011 (Lecture Notes in Computer Science), Kenneth G. Paterson (Ed.), Vol. 6632. Springer, Heidelberg, Germany, Tallinn, Estonia, 169--188.https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"e_1_3_2_1_7_1","volume-title":"ACM CCS 2018: 25th Conference on Computer and Communications Security","author":"B\u00fcscher Niklas","unstructured":"Niklas B\u00fcscher , Daniel Demmler , Stefan Katzenbeisser , David Kretzmer , and Thomas Schneider . 2018. HyCC: Compilation of Hybrid Protocols for Practical Secure Computation . In ACM CCS 2018: 25th Conference on Computer and Communications Security , David Lie, Mohammad Mannan, Michael Backes, and Xiao Feng Wang (Eds.). ACM Press , Toronto, ON , Canada, 847--861.https:\/\/doi.org\/10.1145\/3243734.3243786 10.1145\/3243734.3243786 Niklas B\u00fcscher, Daniel Demmler, Stefan Katzenbeisser, David Kretzmer, and Thomas Schneider. 2018. HyCC: Compilation of Hybrid Protocols for Practical Secure Computation. In ACM CCS 2018: 25th Conference on Computer and Communications Security, David Lie, Mohammad Mannan, Michael Backes, and Xiao Feng Wang (Eds.). ACM Press, Toronto, ON, Canada, 847--861.https:\/\/doi.org\/10.1145\/3243734.3243786"},{"key":"e_1_3_2_1_10_1","volume-title":"In20th Annual ACM Symposium on Theory of Computing. ACM Press","author":"Chaum David","year":"1988","unstructured":"David Chaum , Claude Cr\u00e9peau , and Ivan Damg\u00e5rd . 1988 . Multiparty Uncon-ditionally Secure Protocols (Extended Abstract) . In20th Annual ACM Symposium on Theory of Computing. ACM Press , Chicago, IL, USA, 11--19.https:\/\/doi.org\/10.1145\/62212.62214 10.1145\/62212.62214 David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. 1988. Multiparty Uncon-ditionally Secure Protocols (Extended Abstract). In20th Annual ACM Symposium on Theory of Computing. ACM Press, Chicago, IL, USA, 11--19.https:\/\/doi.org\/10.1145\/62212.62214"},{"key":"e_1_3_2_1_12_1","volume-title":"Smart, and Sarah Zakarias","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd , Valerio Pastro , Nigel P. Smart, and Sarah Zakarias . 2012 . Multiparty Computation from Somewhat Homomorphic Encryption. In Advancesin Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. 7417 . Springer , Heidelberg, Germany,Santa Barbara, CA, USA, 643--662. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38 10.1007\/978-3-642-32009-5_38 Ivan Damg\u00e5rd, Valerio Pastro, Nigel P. Smart, and Sarah Zakarias. 2012. Multiparty Computation from Somewhat Homomorphic Encryption. In Advancesin Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. 7417. Springer, Heidelberg, Germany,Santa Barbara, CA, USA, 643--662. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"e_1_3_2_1_13_1","volume-title":"ABY - A Frame-work for Efficient Mixed-Protocol Secure Two-Party Computation. In ISOC Network and Distributed System Security Symposium -- NDSS","author":"Demmler Daniel","year":"2015","unstructured":"Daniel Demmler , Thomas Schneider , and Michael Zohner . 2015 . ABY - A Frame-work for Efficient Mixed-Protocol Secure Two-Party Computation. In ISOC Network and Distributed System Security Symposium -- NDSS 2015. The Internet Society, San Diego, CA, USA. Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Frame-work for Efficient Mixed-Protocol Secure Two-Party Computation. In ISOC Network and Distributed System Security Symposium -- NDSS 2015. The Internet Society, San Diego, CA, USA."},{"key":"e_1_3_2_1_14_1","volume-title":"Advances in Cryptology -- ASIACRYPT","author":"Frederiksen Tore Kasper","year":"2015","unstructured":"Tore Kasper Frederiksen , Marcel Keller , Emmanuela Orsini , and Peter Scholl .2015. A Unified Approach to MPC with Preprocessing Using OT . In Advances in Cryptology -- ASIACRYPT 2015 , Part I (Lecture Notes in Computer Science), Tetsu Iwata and Jung Hee Cheon (Eds.), Vol. 9452 . Springer , Heidelberg, Germany, Auckland, New Zealand, 711--735. https:\/\/doi.org\/10.1007\/978-3-662-48797--6_29 10.1007\/978-3-662-48797--6_29 Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, and Peter Scholl.2015. A Unified Approach to MPC with Preprocessing Using OT. In Advances in Cryptology -- ASIACRYPT 2015, Part I (Lecture Notes in Computer Science), Tetsu Iwata and Jung Hee Cheon (Eds.), Vol. 9452. Springer, Heidelberg, Germany, Auckland, New Zealand, 711--735. https:\/\/doi.org\/10.1007\/978-3-662-48797--6_29"},{"key":"e_1_3_2_1_15_1","first-page":"74","article-title":"Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers","volume":"2019","author":"Guo Chun","year":"2019","unstructured":"Chun Guo , Jonathan Katz , Xiao Wang , and Yu Yu . 2019 . Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers . IACR Cryptology ePrint Archive 2019 (2019), 74 . https:\/\/eprint.iacr.org\/2019\/074 Chun Guo, Jonathan Katz, Xiao Wang, and Yu Yu. 2019. Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers. IACR Cryptology ePrint Archive 2019 (2019), 74. https:\/\/eprint.iacr.org\/2019\/074","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_16_1","volume-title":"Advances in Cryptology --ASIACRYPT","author":"Hazay Carmit","year":"2017","unstructured":"Carmit Hazay , Peter Scholl , and Eduardo Soria-Vazquez . 2017. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer . In Advances in Cryptology --ASIACRYPT 2017 , Part I (Lecture Notes in Computer Science), Tsuyoshi Takagi and Thomas Peyrin (Eds.), Vol. 10624 . Springer , Heidelberg, Germany, Hong Kong,China, 598--628. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21 10.1007\/978-3-319-70694-8_21 Carmit Hazay, Peter Scholl, and Eduardo Soria-Vazquez. 2017. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. In Advances in Cryptology --ASIACRYPT 2017, Part I (Lecture Notes in Computer Science), Tsuyoshi Takagi and Thomas Peyrin (Eds.), Vol. 10624. Springer, Heidelberg, Germany, Hong Kong,China, 598--628. https:\/\/doi.org\/10.1007\/978-3-319-70694-8_21"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1993.336536"},{"key":"e_1_3_2_1_19_1","volume-title":"Advances in Cryptology -- CRYPTO","author":"Keller Marcel","year":"2015","unstructured":"Marcel Keller , Emmanuela Orsini , and Peter Scholl . 2015. Actively Secure OT Extension with Optimal Overhead . In Advances in Cryptology -- CRYPTO 2015 ,Part I (Lecture Notes in Computer Science), Rosario Gennaro and Matthew J. B. Robshaw (Eds.), Vol. 9215 . Springer , Heidelberg, Germany, Santa Barbara, CA,USA, 724--741. https:\/\/doi.org\/10.1007\/978-3-662-47989-6_35 10.1007\/978-3-662-47989-6_35 Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2015. Actively Secure OT Extension with Optimal Overhead. In Advances in Cryptology -- CRYPTO 2015,Part I (Lecture Notes in Computer Science), Rosario Gennaro and Matthew J. B. Robshaw (Eds.), Vol. 9215. Springer, Heidelberg, Germany, Santa Barbara, CA,USA, 724--741. https:\/\/doi.org\/10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_1_20_1","volume-title":"MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In ACM CCS2016: 23rd Conference on Computer and Communications Security","author":"Keller Marcel","year":"2016","unstructured":"Marcel Keller , Emmanuela Orsini , and Peter Scholl . 2016 . MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In ACM CCS2016: 23rd Conference on Computer and Communications Security , Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi(Eds.). ACM Press , Vienna, Austria , 830--842. https:\/\/doi.org\/10.1145\/2976749.2978357 10.1145\/2976749.2978357 Marcel Keller, Emmanuela Orsini, and Peter Scholl. 2016. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. In ACM CCS2016: 23rd Conference on Computer and Communications Security, Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi(Eds.). ACM Press, Vienna, Austria, 830--842. https:\/\/doi.org\/10.1145\/2976749.2978357"},{"key":"e_1_3_2_1_21_1","volume-title":"Jesper Buus Nielsen and Vincent Rijmen (Eds.)","volume":"10822","author":"Keller Marcel","year":"2018","unstructured":"Marcel Keller , Valerio Pastro , and Dragos Rotaru . 2018 . Overdrive: Making SPDZGreat Again. InAdvances in Cryptology -- EUROCRYPT 2018, Part III (Lecture Notesin Computer Science) , Jesper Buus Nielsen and Vincent Rijmen (Eds.) , Vol. 10822 .Springer, Heidelberg, Germany, Tel Aviv, Israel, 158--189. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6 10.1007\/978-3-319-78372-7_6 Marcel Keller, Valerio Pastro, and Dragos Rotaru. 2018. Overdrive: Making SPDZGreat Again. InAdvances in Cryptology -- EUROCRYPT 2018, Part III (Lecture Notesin Computer Science), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10822.Springer, Heidelberg, Germany, Tel Aviv, Israel, 158--189. https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6"},{"key":"e_1_3_2_1_22_1","volume-title":"Ioana Boureanu","author":"Kerschbaum Florian","unstructured":"Florian Kerschbaum , Thomas Schneider , and Axel Schr\u00f6pfer . 2014. AutomaticProtocol Selection in Secure Two-Party Computations. InACNS 14: 12th International Conference on Applied Cryptography and Network Security (Lecture Notesin Computer Science) , Ioana Boureanu , Philippe Owesarski, and Serge Vaudenay(Eds.), Vol. 8479 . Springer , Heidelberg, Germany , Lausanne, Switzerland, 566--584.https:\/\/doi.org\/10.1007\/978-3-319-07536-5_33 10.1007\/978-3-319-07536-5_33 Florian Kerschbaum, Thomas Schneider, and Axel Schr\u00f6pfer. 2014. AutomaticProtocol Selection in Secure Two-Party Computations. InACNS 14: 12th International Conference on Applied Cryptography and Network Security (Lecture Notesin Computer Science), Ioana Boureanu, Philippe Owesarski, and Serge Vaudenay(Eds.), Vol. 8479. Springer, Heidelberg, Germany, Lausanne, Switzerland, 566--584.https:\/\/doi.org\/10.1007\/978-3-319-07536-5_33"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21548-4_11"},{"key":"e_1_3_2_1_25_1","volume-title":"Claudio Orlandi, and Sai Sheshank Burra.","author":"Nielsen Jesper Buus","year":"2012","unstructured":"Jesper Buus Nielsen , Peter Sebastian Nordholt , Claudio Orlandi, and Sai Sheshank Burra. 2012 . A New Approach to Practical Active-Secure Two-Party Computation. In Advances in Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. 7417 . Springer , Heidelberg, Germany, Santa Barbara, CA, USA, 681--700. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40 10.1007\/978-3-642-32009-5_40 Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012. A New Approach to Practical Active-Secure Two-Party Computation. In Advances in Cryptology -- CRYPTO 2012 (Lecture Notes in Computer Science), Reihaneh Safavi-Naini and Ran Canetti (Eds.), Vol. 7417. Springer, Heidelberg, Germany, Santa Barbara, CA, USA, 681--700. https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"},{"key":"e_1_3_2_1_26_1","first-page":"207","article-title":"MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security","volume":"2019","author":"Rotaru Dragos","year":"2019","unstructured":"Dragos Rotaru and Tim Wood . 2019 . MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security . IACR Cryptology ePrint Archive 2019 (2019), 207 . https:\/\/eprint.iacr.org\/2019\/207 Dragos Rotaru and Tim Wood. 2019. MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security. IACR Cryptology ePrint Archive 2019(2019), 207. https:\/\/eprint.iacr.org\/2019\/207","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_27_1","volume-title":"Smart and Tim Wood","author":"Nigel","year":"2019","unstructured":"Nigel P. Smart and Tim Wood . 2019 . Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation. In Topicsin Cryptology -- CT-RSA 2019 (Lecture Notes in Computer Science), Mitsuru Matsui(Ed.), Vol. 11405 . Springer , Heidelberg, Germany, San Francisco, CA, USA, 210--229. https:\/\/doi.org\/10.1007\/978-3-030-12612-4_11 10.1007\/978-3-030-12612-4_11 Nigel P. Smart and Tim Wood. 2019. Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-party Computation. In Topicsin Cryptology -- CT-RSA 2019 (Lecture Notes in Computer Science), Mitsuru Matsui(Ed.), Vol. 11405. Springer, Heidelberg, Germany, San Francisco, CA, USA, 210--229. https:\/\/doi.org\/10.1007\/978-3-030-12612-4_11"},{"key":"e_1_3_2_1_28_1","volume-title":"ACM CCS 2017: 24th Conference on Computer and Communications Security","author":"Wang Xiao","unstructured":"Xiao Wang , Samuel Ranellucci , and Jonathan Katz . 2017. Global-Scale Secure Multiparty Computation . In ACM CCS 2017: 24th Conference on Computer and Communications Security , Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu (Eds.). ACM Press , Dallas, TX, USA , 39--56. https:\/\/doi.org\/10.1145\/3133956.3133979 10.1145\/3133956.3133979 Xiao Wang, Samuel Ranellucci, and Jonathan Katz. 2017. Global-Scale Secure Multiparty Computation. In ACM CCS 2017: 24th Conference on Computer and Communications Security, Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu (Eds.). ACM Press, Dallas, TX, USA, 39--56. https:\/\/doi.org\/10.1145\/3133956.3133979"},{"key":"e_1_3_2_1_29_1","volume-title":"23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press","author":"Chi-Chih Yao Andrew","year":"1982","unstructured":"Andrew Chi-Chih Yao . 1982 . Protocols for Secure Computations (Extended Abstract) . In 23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press , Chicago, Illinois, 160--164. https:\/\/doi.org\/10.1109\/SFCS. 1982.38 10.1109\/SFCS.1982.38 Andrew Chi-Chih Yao. 1982. Protocols for Secure Computations (Extended Abstract). In 23rd Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Chicago, Illinois, 160--164. https:\/\/doi.org\/10.1109\/SFCS.1982.38"}],"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 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338469.3358943","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338469.3358943","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338469.3358943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:48Z","timestamp":1750201968000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338469.3358943"}},"subtitle":["Efficiently Combining LSSS and Garbled Circuits in SCALE"],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":25,"alternative-id":["10.1145\/3338469.3358943","10.1145\/3338469"],"URL":"https:\/\/doi.org\/10.1145\/3338469.3358943","relation":{},"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"2019-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}