{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:12Z","timestamp":1750220052163,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":85,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"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":[[2023,7,10]]},"DOI":"10.1145\/3579856.3590340","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"649-663","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["FUSE \u2013 Flexible File Format and Intermediate Representation for Secure Multi-Party Computation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9164-305X","authenticated-orcid":false,"given":"Lennart","family":"Braun","sequence":"first","affiliation":[{"name":"Aarhus University, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5292-1321","authenticated-orcid":false,"given":"Moritz","family":"Huppert","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3159-5898","authenticated-orcid":false,"given":"Nora","family":"Khayata","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8090-1316","authenticated-orcid":false,"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9232-6902","authenticated-orcid":false,"given":"Oleksandr","family":"Tkachenko","sequence":"additional","affiliation":[{"name":"DFINITY Foundation, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Co\u015fku Acay Rolph Recto Joshua Gancher Andrew\u00a0C. Myers and Elaine Shi. 2021. Viaduct: an extensible optimizing compiler for secure distributed programs. In SIGPLAN. Co\u015fku Acay Rolph Recto Joshua Gancher Andrew\u00a0C. Myers and Elaine Shi. 2021. Viaduct: an extensible optimizing compiler for secure distributed programs. In SIGPLAN.","DOI":"10.1145\/3410299"},{"key":"e_1_3_2_1_2_1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho V.","year":"2006","unstructured":"Alfred\u00a0 V. Aho , Monica\u00a0 S. Lam , Ravi Sethi , and Jeffrey\u00a0 D. Ullman . 2006 . Compilers: Principles, Techniques, and Tools ( 2 nd Edition). Addison-Wesley Longman Publishing Co., Inc. Alfred\u00a0V. Aho, Monica\u00a0S. Lam, Ravi Sethi, and Jeffrey\u00a0D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (2nd Edition). Addison-Wesley Longman Publishing Co., Inc.","edition":"2"},{"key":"e_1_3_2_1_3_1","unstructured":"Alexandra Institute. 2022. FRESCO - A FRamework for Efficient Secure COmputation. https:\/\/github.com\/aicis\/fresco. Alexandra Institute. 2022. FRESCO - A FRamework for Efficient Secure COmputation. https:\/\/github.com\/aicis\/fresco."},{"key":"e_1_3_2_1_4_1","unstructured":"Abdelrahaman Aly Benjamin Coenen Kelong Cong Karl Koch Marcel Keller Dragos Rotaru Oliver Scherer Peter Scholl Nigel\u00a0P. Smart Titouan Tanguy and Tim Wood. 2021. SCALE\u2013MAMBA v1.14 : Documentation. https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/SCALE\/Documentation-SCALE.pdf. Abdelrahaman Aly Benjamin Coenen Kelong Cong Karl Koch Marcel Keller Dragos Rotaru Oliver Scherer Peter Scholl Nigel\u00a0P. Smart Titouan Tanguy and Tim Wood. 2021. SCALE\u2013MAMBA v1.14 : Documentation. https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/SCALE\/Documentation-SCALE.pdf."},{"key":"e_1_3_2_1_5_1","unstructured":"David Archer Victor\u00a0Arribas Abril Steve Lu Pieter Maene Nele Mertens Danilo Sijacic and Nigel Smart. 2019. Bristol Fashion MPC Circuits. https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/MPC\/. David Archer Victor\u00a0Arribas Abril Steve Lu Pieter Maene Nele Mertens Danilo Sijacic and Nigel Smart. 2019. Bristol Fashion MPC Circuits. https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/MPC\/."},{"key":"e_1_3_2_1_6_1","volume-title":"Smart, and Rebecca\u00a0N. Wright","author":"Archer W.","year":"2018","unstructured":"David\u00a0 W. Archer , Dan Bogdanov , Yehuda Lindell , Liina Kamm , Kurt Nielsen , Jakob\u00a0Illeborg Pagter , Nigel\u00a0 P. Smart, and Rebecca\u00a0N. Wright . 2018 . From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. Computer Journal ( 2018). David\u00a0W. Archer, Dan Bogdanov, Yehuda Lindell, Liina Kamm, Kurt Nielsen, Jakob\u00a0Illeborg Pagter, Nigel\u00a0P. Smart, and Rebecca\u00a0N. Wright. 2018. From Keys to Databases - Real-World Applications of Secure Multi-Party Computation. Computer Journal (2018)."},{"key":"e_1_3_2_1_7_1","volume-title":"Emmanuela Orsini, Nigel\u00a0P. Smart, and Titouan Tanguy.","author":"Baghery Karim","year":"2021","unstructured":"Karim Baghery , Cyprien Delpech de\u00a0Saint Guilhem , Emmanuela Orsini, Nigel\u00a0P. Smart, and Titouan Tanguy. 2021 . Compilation of Function Representations for Secure Computing Paradigms. In CT-RSA. Karim Baghery, Cyprien Delpech de\u00a0Saint Guilhem, Emmanuela Orsini, Nigel\u00a0P. Smart, and Titouan Tanguy. 2021. Compilation of Function Representations for Secure Computing Paradigms. In CT-RSA."},{"key":"e_1_3_2_1_8_1","unstructured":"Junjie Bai Fang Lu Ke Zhang 2019. ONNX. https:\/\/github.com\/onnx\/onnx. Junjie Bai Fang Lu Ke Zhang 2019. ONNX. https:\/\/github.com\/onnx\/onnx."},{"key":"e_1_3_2_1_9_1","unstructured":"Marshall Ball Brent Carmer Tal Malkin Mike Rosulek and Nichole Schimanski. 2019. Garbled Neural Networks are Practical. Cryptology ePrint Archive Paper 2019\/338. Marshall Ball Brent Carmer Tal Malkin Mike Rosulek and Nichole Schimanski. 2019. Garbled Neural Networks are Practical. Cryptology ePrint Archive Paper 2019\/338."},{"key":"e_1_3_2_1_10_1","volume-title":"HACCLE: Metaprogramming for Secure Multi-Party Computation. In GPCE.","author":"Bao Yuyan","year":"2021","unstructured":"Yuyan Bao , Kirshanthan Sundararajah , Raghav Malik , Qianchuan Ye , Christopher Wagner , Nouraldin Jaber , Fei Wang , Mohammad\u00a0Hassan Ameri , Donghang Lu , Alexander Seto , Benjamin Delaware , Roopsha Samanta , Aniket Kate , Christina Garman , Jeremiah Blocki , Pierre-David Letourneau , Benoit Meister , Jonathan Springer , Tiark Rompf , and Milind Kulkarni . 2021 . HACCLE: Metaprogramming for Secure Multi-Party Computation. In GPCE. Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad\u00a0Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoit Meister, Jonathan Springer, Tiark Rompf, and Milind Kulkarni. 2021. HACCLE: Metaprogramming for Secure Multi-Party Computation. In GPCE."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Donald Beaver Silvio Micali and Phillip Rogaway. 1990. The round complexity of secure protocols. In STOC. Donald Beaver Silvio Micali and Phillip Rogaway. 1990. The round complexity of secure protocols. In STOC.","DOI":"10.1145\/100216.100287"},{"key":"e_1_3_2_1_12_1","unstructured":"Gabrielle Beck Aarushi Goel Abhishek Jain and Gabriel Kaptchuk. 2021. Order-C Secure Multiparty Computation for Highly Repetitive Circuits. In EUROCRYPT. Gabrielle Beck Aarushi Goel Abhishek Jain and Gabriel Kaptchuk. 2021. Order-C Secure Multiparty Computation for Highly Repetitive Circuits. In EUROCRYPT."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Mihir Bellare Viet\u00a0Tung Hoang Sriram Keelveedhi and Phillip Rogaway. 2013. Efficient Garbling from a Fixed-Key Blockcipher. In S&P. Mihir Bellare Viet\u00a0Tung Hoang Sriram Keelveedhi and Phillip Rogaway. 2013. Efficient Garbling from a Fixed-Key Blockcipher. In S&P.","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: A System for Secure Multi-Party Computation. In CCS. Assaf Ben-David Noam Nisan and Benny Pinkas. 2008. FairplayMP: A System for Secure Multi-Party Computation. In CCS.","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In STOC. Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In STOC.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Dan Bogdanov Roman Jagom\u00e4gis and Sven Laur. 2012. A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining. In PAISI. Dan Bogdanov Roman Jagom\u00e4gis and Sven Laur. 2012. A Universal Toolkit for Cryptographically Secure Privacy-Preserving Data Mining. In PAISI.","DOI":"10.1007\/978-3-642-30428-6_9"},{"key":"e_1_3_2_1_17_1","volume-title":"Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS.","author":"Bogdanov Dan","year":"2008","unstructured":"Dan Bogdanov , Sven Laur , and Jan Willemson . 2008 . Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS. Dan Bogdanov, Sven Laur, and Jan Willemson. 2008. Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Peter Bogetoft Ivan Damg\u00e5rd Thomas\u00a0P. Jakobsen Kurt Nielsen Jakob\u00a0Illeborg Pagter and Tomas Toft. 2006. A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In Financial Cryptography. Peter Bogetoft Ivan Damg\u00e5rd Thomas\u00a0P. Jakobsen Kurt Nielsen Jakob\u00a0Illeborg Pagter and Tomas Toft. 2006. A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In Financial Cryptography.","DOI":"10.1007\/11889663_10"},{"key":"e_1_3_2_1_19_1","volume-title":"On the Variable Ordering in Subgraph Isomorphism Algorithms","author":"Bonnici Vincenzo","year":"2017","unstructured":"Vincenzo Bonnici and Rosalba Giugno . 2017. On the Variable Ordering in Subgraph Isomorphism Algorithms . IEEE\/ACM Transactions on Computational Biology and Bioinformatics ( 2017 ). Vincenzo Bonnici and Rosalba Giugno. 2017. On the Variable Ordering in Subgraph Isomorphism Algorithms. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (2017)."},{"key":"e_1_3_2_1_20_1","volume-title":"NeurIPS 2021 Workshop Privacy in Machine Learning.","author":"Braun Lennart","year":"2021","unstructured":"Lennart Braun , Rosario Cammarota , and Thomas Schneider . 2021 . A Generic Hybrid 2PC Framework with Application to Private Inference of Unmodified Neural Networks . In NeurIPS 2021 Workshop Privacy in Machine Learning. Lennart Braun, Rosario Cammarota, and Thomas Schneider. 2021. A Generic Hybrid 2PC Framework with Application to Private Inference of Unmodified Neural Networks. In NeurIPS 2021 Workshop Privacy in Machine Learning."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Lennart Braun Daniel Demmler Thomas Schneider and Oleksandr Tkachenko. 2022. MOTION \u2013 A Framework for Mixed-Protocol Multi-Party Computation. In TOPS. Lennart Braun Daniel Demmler Thomas Schneider and Oleksandr Tkachenko. 2022. MOTION \u2013 A Framework for Mixed-Protocol Multi-Party Computation. In TOPS.","DOI":"10.1145\/3490390"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Lennart Braun Moritz Huppert Nora Khayata Thomas Schneider and Oleksandr Tkachenko. 2023. FUSE \u2013 Flexible File Format and Intermediate Representation for Secure Multi-Party Computation. Cryptology ePrint Archive Paper 2023\/563. Lennart Braun Moritz Huppert Nora Khayata Thomas Schneider and Oleksandr Tkachenko. 2023. FUSE \u2013 Flexible File Format and Intermediate Representation for Secure Multi-Party Computation. Cryptology ePrint Archive Paper 2023\/563.","DOI":"10.1145\/3579856.3590340"},{"key":"e_1_3_2_1_23_1","unstructured":"Niklas Buescher and Stefan Katzenbeisser. 2015. Faster Secure Computation through Automatic Parallelization. In USENIX Security. Niklas Buescher and Stefan Katzenbeisser. 2015. Faster Secure Computation through Automatic Parallelization. In USENIX Security."},{"key":"e_1_3_2_1_24_1","unstructured":"Niklas Buescher and David Kretzmer. 2013. Simple Circuit Description (SCD). https:\/\/github.com\/esonghori\/TinyGarble\/tree\/master\/scd. Niklas Buescher and David Kretzmer. 2013. Simple Circuit Description (SCD). https:\/\/github.com\/esonghori\/TinyGarble\/tree\/master\/scd."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Niklas B\u00fcscher Daniel Demmler Stefan Katzenbeisser David Kretzmer and Thomas Schneider. 2018. HyCC: Compilation of Hybrid Protocols for Practical Secure Computation. In CCS. Niklas B\u00fcscher Daniel Demmler Stefan Katzenbeisser David Kretzmer and Thomas Schneider. 2018. HyCC: Compilation of Hybrid Protocols for Practical Secure Computation. In CCS.","DOI":"10.1145\/3243734.3243786"},{"key":"e_1_3_2_1_26_1","volume-title":"Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3","author":"Carletti Vincenzo","year":"2018","unstructured":"Vincenzo Carletti , Pasquale Foggia , Alessia Saggese , and Mario Vento . 2018. Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3 . IEEE Transactions on Pattern Analysis and Machine Intelligence ( 2018 ). Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, and Mario Vento. 2018. Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3. IEEE Transactions on Pattern Analysis and Machine Intelligence (2018)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Nishanth Chandran Divya Gupta Aseem Rastogi Rahul Sharma and Shardul Tripathi. 2019. EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning. In EuroS&P. Nishanth Chandran Divya Gupta Aseem Rastogi Rahul Sharma and Shardul Tripathi. 2019. EzPC: Programmable and Efficient Secure Two-Party Computation for Machine Learning. In EuroS&P.","DOI":"10.1109\/EuroSP.2019.00043"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"David Chaum Claude Cr\u00e9peau and Ivan Damgard. 1988. Multiparty Unconditionally Secure Protocols. In STOC. David Chaum Claude Cr\u00e9peau and Ivan Damgard. 1988. Multiparty Unconditionally Secure Protocols. In STOC.","DOI":"10.1145\/62212.62214"},{"key":"e_1_3_2_1_29_1","volume-title":"Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In CRYPTO.","author":"Couteau Geoffroy","year":"2021","unstructured":"Geoffroy Couteau , Peter Rindal , and Srinivasan Raghuraman . 2021 . Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In CRYPTO. Geoffroy Couteau, Peter Rindal, and Srinivasan Raghuraman. 2021. Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes. In CRYPTO."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Martin Geisler Mikkel Kr\u00f8igaard and Jesper\u00a0Buus Nielsen. 2009. Asynchronous Multiparty Computation: Theory and Implementation. In PKC. Ivan Damg\u00e5rd Martin Geisler Mikkel Kr\u00f8igaard and Jesper\u00a0Buus Nielsen. 2009. Asynchronous Multiparty Computation: Theory and Implementation. In PKC.","DOI":"10.1007\/978-3-642-00468-1_10"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Ghada Dessouky Farinaz Koushanfar Ahmad-Reza Sadeghi Thomas Schneider and Shaza Zeitouni. 2015. Automated Synthesis of Optimized Circuits for Secure Computation. In CCS. Daniel Demmler Ghada Dessouky Farinaz Koushanfar Ahmad-Reza Sadeghi Thomas Schneider and Shaza Zeitouni. 2015. Automated Synthesis of Optimized Circuits for Secure Computation. In CCS.","DOI":"10.1145\/2810103.2813678"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Stefan Katzenbeisser Thomas Schneider Tom Schuster and Christian Weinert. 2021. Improved Circuit Compilation for Hybrid MPC via Compiler Intermediate Representation. In SECRYPT. Daniel Demmler Stefan Katzenbeisser Thomas Schneider Tom Schuster and Christian Weinert. 2021. Improved Circuit Compilation for Hybrid MPC via Compiler Intermediate Representation. In SECRYPT.","DOI":"10.5220\/0010540504440451"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY \u2013 A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS. Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY \u2013 A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS.","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_34_1","volume-title":"Songhori and Siam Umar Hussain and Ahmad-Reza Sadeghi and T. Schneider and Farinaz Koushanfar","author":"Ebrahim","year":"2015","unstructured":"Ebrahim M. Songhori and Siam Umar Hussain and Ahmad-Reza Sadeghi and T. Schneider and Farinaz Koushanfar . 2015 . TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. In S &P. Ebrahim M. Songhori and Siam Umar Hussain and Ahmad-Reza Sadeghi and T. Schneider and Farinaz Koushanfar. 2015. TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. In S&P."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Vivian Fang Lloyd Brown William Lin Wenting Zheng Aurojit Panda and Raluca\u00a0Ada Popa. 2022. CostCO: An automatic cost modeling framework for secure multi-party computation. In EuroS&P. Vivian Fang Lloyd Brown William Lin Wenting Zheng Aurojit Panda and Raluca\u00a0Ada Popa. 2022. CostCO: An automatic cost modeling framework for secure multi-party computation. In EuroS&P.","DOI":"10.1109\/EuroSP53844.2022.00017"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Martin Franz Andreas Holzer Stefan Katzenbeisser Christian Schallhart and Helmut Veith. 2014. CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations. In Compiler Construction. Martin Franz Andreas Holzer Stefan Katzenbeisser Christian Schallhart and Helmut Veith. 2014. CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations. In Compiler Construction.","DOI":"10.1007\/978-3-642-54807-9_15"},{"key":"e_1_3_2_1_37_1","volume-title":"An open graph visualization system and its applications to software engineering","author":"Gansner R.","year":"2000","unstructured":"Emden\u00a0 R. Gansner and Stephen\u00a0 C. North . 2000. An open graph visualization system and its applications to software engineering . Software : Practice and Experience ( 2000 ). Emden\u00a0R. Gansner and Stephen\u00a0C. North. 2000. An open graph visualization system and its applications to software engineering. Software: Practice and Experience (2000)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Daniel Genkin Yuval Ishai and Antigoni Polychroniadou. 2015. Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits. In CRYPTO. Daniel Genkin Yuval Ishai and Antigoni Polychroniadou. 2015. Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits. In CRYPTO.","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio\u00a0M. Micali and Avi Wigderson. 1987. How to Play ANY Mental Game. In STOC. Oded Goldreich Silvio\u00a0M. Micali and Avi Wigderson. 1987. How to Play ANY Mental Game. In STOC.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Marcella Hastings Brett Hemenway Daniel Noble and Steve Zdancewic. 2019. SoK: General Purpose Compilers for Secure Multi-Party Computation. In S&P. Marcella Hastings Brett Hemenway Daniel Noble and Steve Zdancewic. 2019. SoK: General Purpose Compilers for Secure Multi-Party Computation. In S&P.","DOI":"10.1109\/SP.2019.00028"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Tim Heldmann Thomas Schneider Oleksandr Tkachenko Christian Weinert and Hossein Yalame. 2021. LLVM-Based Circuit Compilation for Practical Secure Computation. In ACNS. Tim Heldmann Thomas Schneider Oleksandr Tkachenko Christian Weinert and Hossein Yalame. 2021. LLVM-Based Circuit Compilation for Practical Secure Computation. In ACNS.","DOI":"10.1007\/978-3-030-78375-4_5"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Brett Hemenway Steve Lu Rafail Ostrovsky and William Welser\u00a0IV. 2016. High-Precision Secure Computation of Satellite Collision Probabilities. In SCN. Brett Hemenway Steve Lu Rafail Ostrovsky and William Welser\u00a0IV. 2016. High-Precision Secure Computation of Satellite Collision Probabilities. In SCN.","DOI":"10.1007\/978-3-319-44618-9_9"},{"key":"e_1_3_2_1_43_1","volume-title":"TASTY: Tool for Automating Secure Two-Party Computations. In CCS.","author":"Henecka Wilko","year":"2010","unstructured":"Wilko Henecka , Stefan K\u00a0\u00f6gl , Ahmad-Reza Sadeghi , Thomas Schneider , and Immo Wehrenberg . 2010 . TASTY: Tool for Automating Secure Two-Party Computations. In CCS. Wilko Henecka, Stefan K\u00a0\u00f6gl, Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. 2010. TASTY: Tool for Automating Secure Two-Party Computations. In CCS."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Wilko Henecka and Thomas Schneider. 2013. Faster Secure Two-Party Computation with Less Memory. In CCS. Wilko Henecka and Thomas Schneider. 2013. Faster Secure Two-Party Computation with Less Memory. In CCS.","DOI":"10.1145\/2484313.2484369"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Yan Huang David Evans Jonathan Katz and Lior Malka. 2011. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security. Yan Huang David Evans Jonathan Katz and Lior Malka. 2011. Faster Secure Two-Party Computation Using Garbled Circuits. In USENIX Security.","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Muhammad Ishaq Ana\u00a0L. Milanova and Vassilis Zikas. 2019. Efficient MPC via Program Analysis: A Framework for Efficient Optimal Mixing. In CCS. Muhammad Ishaq Ana\u00a0L. Milanova and Vassilis Zikas. 2019. Efficient MPC via Program Analysis: A Framework for Efficient Optimal Mixing. In CCS.","DOI":"10.1145\/3319535.3339818"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS. Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_3_2_1_48_1","volume-title":"Smart","author":"Keller Marcel","year":"2013","unstructured":"Marcel Keller , Peter Scholl , and Nigel\u00a0 P. Smart . 2013 . An Architecture for Practical Actively Secure MPC with Dishonest Majority. In CCS. Marcel Keller, Peter Scholl, and Nigel\u00a0P. Smart. 2013. An Architecture for Practical Actively Secure MPC with Dishonest Majority. In CCS."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Florian Kerschbaum. 2011. Automatically Optimizing Secure Computation. In CCS. Florian Kerschbaum. 2011. Automatically Optimizing Secure Computation. In CCS.","DOI":"10.1145\/2046707.2046786"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Florian Kerschbaum. 2013. Expression Rewriting for Optimizing Secure Computation. In CODASPY. Florian Kerschbaum. 2013. Expression Rewriting for Optimizing Secure Computation. In CODASPY.","DOI":"10.1145\/2435349.2435356"},{"key":"e_1_3_2_1_51_1","volume-title":"DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS.","author":"Kolesnikov Vladimir","year":"2017","unstructured":"Vladimir Kolesnikov , Jesper\u00a0Buus Nielsen , Mike Rosulek , Ni Trieu , and Roberto Trifiletti . 2017 . DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS. Vladimir Kolesnikov, Jesper\u00a0Buus Nielsen, Mike Rosulek, Ni Trieu, and Roberto Trifiletti. 2017. DUPLO: Unifying Cut-and-Choose for Garbled Circuits. In CCS."},{"key":"e_1_3_2_1_52_1","volume-title":"PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security.","author":"Kreuter Ben","year":"2013","unstructured":"Ben Kreuter , Benjamin Mood , Abhi Shelat , and Kevin Butler . 2013 . PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security. Ben Kreuter, Benjamin Mood, Abhi Shelat, and Kevin Butler. 2013. PCF: A portable circuit format for scalable two-party secure computation. In USENIX Security."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Benjamin Levy Ben Sherman Muhammad Ishaq Lindsey Kennard Ana Milanova and Vassilis Zikas. 2023. Compilation and Backend-Independent Vectorization for Multi-Party Computation. Cryptology ePrint Archive Paper 2023\/089. Benjamin Levy Ben Sherman Muhammad Ishaq Lindsey Kennard Ana Milanova and Vassilis Zikas. 2023. Compilation and Backend-Independent Vectorization for Multi-Party Computation. Cryptology ePrint Archive Paper 2023\/089.","DOI":"10.1145\/3576915.3623181"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Chang Liu Xiao\u00a0Shaun Wang Kartik Nayak Yan Huang and Elaine Shi. 2015. ObliVM: A Programming Framework for Secure Computation. In S&P. Chang Liu Xiao\u00a0Shaun Wang Kartik Nayak Yan Huang and Elaine Shi. 2015. ObliVM: A Programming Framework for Secure Computation. In S&P.","DOI":"10.1109\/SP.2015.29"},{"key":"e_1_3_2_1_56_1","unstructured":"Donghang Lu Thomas Yurek Samarth Kulshreshtha Rahul Govind Aniket Kate and Andrew Miller. 2019. HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and Its Application to Anonymous Communication. In CCS. Donghang Lu Thomas Yurek Samarth Kulshreshtha Rahul Govind Aniket Kate and Andrew Miller. 2019. HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and Its Application to Anonymous Communication. In CCS."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Lior Malka. 2011. VMCrypt: Modular Software Architecture for Scalable Secure Computation. In CCS. Lior Malka. 2011. VMCrypt: Modular Software Architecture for Scalable Secure Computation. In CCS.","DOI":"10.1145\/2046707.2046787"},{"key":"e_1_3_2_1_58_1","unstructured":"Dahlia Malkhi Noam Nisan Benny Pinkas and Yaron Sella. 2004. Fairplay - a Secure Two-Party Computation System. In USENIX Security. Dahlia Malkhi Noam Nisan Benny Pinkas and Yaron Sella. 2004. Fairplay - a Secure Two-Party Computation System. In USENIX Security."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Ciaran McCreesh Patrick Prosser and James Trimble. 2020. The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. In Graph Transformation. Ciaran McCreesh Patrick Prosser and James Trimble. 2020. The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants. In Graph Transformation.","DOI":"10.1007\/978-3-030-51372-6_19"},{"key":"e_1_3_2_1_60_1","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In CCS. Payman Mohassel and Peter Rindal. 2018. ABY3: A Mixed Protocol Framework for Machine Learning. In CCS."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"crossref","unstructured":"Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In S&P. Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In S&P.","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_1_62_1","volume-title":"Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation. In EuroS&P.","author":"Mood Benjamin","year":"2016","unstructured":"Benjamin Mood , Debayan Gupta , Henry Carter , Kevin Butler , and Patrick Traynor . 2016 . Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation. In EuroS&P. Benjamin Mood, Debayan Gupta, Henry Carter, Kevin Butler, and Patrick Traynor. 2016. Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation. In EuroS&P."},{"key":"e_1_3_2_1_63_1","volume-title":"VASA: Vector AES Instructions for Security Applications. In ACSAC.","author":"M\u00fcnch Jean-Pierre","year":"2021","unstructured":"Jean-Pierre M\u00fcnch , Thomas Schneider , and Hossein Yalame . 2021 . VASA: Vector AES Instructions for Security Applications. In ACSAC. Jean-Pierre M\u00fcnch, Thomas Schneider, and Hossein Yalame. 2021. VASA: Vector AES Instructions for Security Applications. In ACSAC."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Kartik Nayak Xiao\u00a0Shaun Wang Stratis Ioannidis Udi Weinsberg Nina Taft and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. In S&P. Kartik Nayak Xiao\u00a0Shaun Wang Stratis Ioannidis Udi Weinsberg Nina Taft and Elaine Shi. 2015. GraphSC: Parallel Secure Computation Made Easy. In S&P.","DOI":"10.1109\/SP.2015.30"},{"key":"e_1_3_2_1_65_1","unstructured":"Alex Ozdemir Fraser Brown and Riad\u00a0S. Wahby. 2020. Unifying Compilers for SNARKs SMT and More. Cryptology ePrint Archive Paper 2020\/1586. Alex Ozdemir Fraser Brown and Riad\u00a0S. Wahby. 2020. Unifying Compilers for SNARKs SMT and More. Cryptology ePrint Archive Paper 2020\/1586."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"crossref","unstructured":"Alex Ozdemir Fraser Brown and Riad\u00a0S. Wahby. 2022. CirC: Compiler infrastructure for proof systems software verification and more. In S&P. Alex Ozdemir Fraser Brown and Riad\u00a0S. Wahby. 2022. CirC: Compiler infrastructure for proof systems software verification and more. In S&P.","DOI":"10.1109\/SP46214.2022.9833782"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Arpita Patra Thomas Schneider Ajith Suresh and Hossein Yalame. 2021. SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. In HOST. Arpita Patra Thomas Schneider Ajith Suresh and Hossein Yalame. 2021. SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. In HOST.","DOI":"10.1109\/HOST49136.2021.9702293"},{"key":"e_1_3_2_1_68_1","volume-title":"Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations. In S&P.","author":"Rastogi Aseem","year":"2014","unstructured":"Aseem Rastogi , Matthew\u00a0 A. Hammer , and Michael Hicks . 2014 . Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations. In S&P. Aseem Rastogi, Matthew\u00a0A. Hammer, and Michael Hicks. 2014. Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations. In S&P."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Aseem Rastogi Nikhil Swamy and Michael\u00a0W. Hicks. 2019. Wys*: A DSL for Verified Secure Multi-party Computations. In POST. Aseem Rastogi Nikhil Swamy and Michael\u00a0W. Hicks. 2019. Wys*: A DSL for Verified Secure Multi-party Computations. In POST.","DOI":"10.1007\/978-3-030-17138-4_5"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"crossref","unstructured":"M.\u00a0Sadegh Riazi Mojan Javaheripi Siam\u00a0U. Hussain and Farinaz Koushanfar. 2019. MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation. In HOST. M.\u00a0Sadegh Riazi Mojan Javaheripi Siam\u00a0U. Hussain and Farinaz Koushanfar. 2019. MPCircuits: Optimized Circuit Generation for Secure Multi-Party Computation. In HOST.","DOI":"10.1109\/HST.2019.8740831"},{"key":"e_1_3_2_1_71_1","unstructured":"Neal Richardson Ian Cook Nic Crane Dewey Dunnington Romain Fran\u00e7ois Jonathan Keane Drago\u0219 Moldovan-Gr\u00fcnfeld Jeroen Ooms and Apache Arrow. 2022. arrow: Integration to Apache Arrow. https:\/\/arrow.apache.org\/docs\/r\/. Neal Richardson Ian Cook Nic Crane Dewey Dunnington Romain Fran\u00e7ois Jonathan Keane Drago\u0219 Moldovan-Gr\u00fcnfeld Jeroen Ooms and Apache Arrow. 2022. arrow: Integration to Apache Arrow. https:\/\/arrow.apache.org\/docs\/r\/."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"crossref","unstructured":"Thomas Schneider and Michael Zohner. 2013. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits. In FC. Thomas Schneider and Michael Zohner. 2013. GMW vs. Yao? Efficient Secure Two-Party Computation with Low Depth Circuits. In FC.","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"e_1_3_2_1_73_1","unstructured":"Berry Schoenmakers. 2018. MPyC: Multiparty Computation in Python. https:\/\/www.win.tue.nl\/\u00a0berry\/mpyc\/. Berry Schoenmakers. 2018. MPyC: Multiparty Computation in Python. https:\/\/www.win.tue.nl\/\u00a0berry\/mpyc\/."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Axel Schropfer Florian Kerschbaum and Gunter Muller. 2011. L1 - An Intermediate Language for Mixed-Protocol Secure Computation. In COMPSAC. Axel Schropfer Florian Kerschbaum and Gunter Muller. 2011. L1 - An Intermediate Language for Mixed-Protocol Secure Computation. In COMPSAC.","DOI":"10.1109\/COMPSAC.2011.46"},{"key":"e_1_3_2_1_75_1","unstructured":"Nigel Smart and Stefan Tillich. 2019. (Bristol Format) Circuits of Basic Functions Suitable For MPC and FHE. https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/MPC\/old-circuits.html. Nigel Smart and Stefan Tillich. 2019. (Bristol Format) Circuits of Basic Functions Suitable For MPC and FHE. https:\/\/homes.esat.kuleuven.be\/\u00a0nsmart\/MPC\/old-circuits.html."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Christine Solnon. 2010. AllDifferent-based filtering for subgraph isomorphism. Artif. Intell. (2010). Christine Solnon. 2010. AllDifferent-based filtering for subgraph isomorphism. Artif. Intell. (2010).","DOI":"10.1016\/j.artint.2010.05.002"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"crossref","unstructured":"Christine Solnon. 2019. Experimental Evaluation of Subgraph Isomorphism Solvers. In Graph-Based Representations in Pattern Recognition. Christine Solnon. 2019. Experimental Evaluation of Subgraph Isomorphism Solvers. In Graph-Based Representations in Pattern Recognition.","DOI":"10.1007\/978-3-030-20081-7_1"},{"key":"e_1_3_2_1_78_1","volume":"201","author":"Talukder Nilothpal","unstructured":"Nilothpal Talukder and Mohammed\u00a0 J. Zaki. 201 6. A Distributed Approach for Graph Mining in Massive Networks. Data Min. Knowl. Discov. (2016). Nilothpal Talukder and Mohammed\u00a0J. Zaki. 2016. A Distributed Approach for Graph Mining in Massive Networks. Data Min. Knowl. Discov. (2016).","journal-title":"J. Zaki."},{"key":"e_1_3_2_1_79_1","unstructured":"Wouter van Oortmerssen. 2014. FlatBuffers. https:\/\/github.com\/google\/flatbuffers. Wouter van Oortmerssen. 2014. FlatBuffers. https:\/\/github.com\/google\/flatbuffers."},{"key":"e_1_3_2_1_80_1","unstructured":"Wouter van Oortmerssen. 2017. FlexBuffers. https:\/\/google.github.io\/flatbuffers\/flexbuffers.html. Wouter van Oortmerssen. 2017. FlexBuffers. https:\/\/google.github.io\/flatbuffers\/flexbuffers.html."},{"key":"e_1_3_2_1_81_1","unstructured":"Kenton Varda 2013. Cap\u2019n Proto. https:\/\/capnproto.org\/index.html. Kenton Varda 2013. Cap\u2019n Proto. https:\/\/capnproto.org\/index.html."},{"key":"e_1_3_2_1_82_1","unstructured":"Xiao Wang Alex\u00a0J. Malozemoff and Jonathan Katz. 2016. EMPtoolkit: Efficient MultiParty computation toolkit. https:\/\/github. com\/emp-toolkit. Xiao Wang Alex\u00a0J. Malozemoff and Jonathan Katz. 2016. EMPtoolkit: Efficient MultiParty computation toolkit. https:\/\/github. com\/emp-toolkit."},{"key":"e_1_3_2_1_83_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In FOCS. Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In FOCS."},{"key":"e_1_3_2_1_84_1","volume-title":"Paper 2015\/1153","author":"Zahur Samee","year":"2015","unstructured":"Samee Zahur and David Evans . 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. Cryptology ePrint Archive , Paper 2015\/1153 ( 2015 ). Samee Zahur and David Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. Cryptology ePrint Archive, Paper 2015\/1153 (2015)."},{"key":"e_1_3_2_1_85_1","volume-title":"Cerebro: A Platform for Multi-Party Cryptographic Collaborative Learning. In USENIX Security.","author":"Zheng Wenting","year":"2021","unstructured":"Wenting Zheng , Ryan Deng , Weikeng Chen , Raluca\u00a0Ada Popa , Aurojit Panda , and Ion Stoica . 2021 . Cerebro: A Platform for Multi-Party Cryptographic Collaborative Learning. In USENIX Security. Wenting Zheng, Ryan Deng, Weikeng Chen, Raluca\u00a0Ada Popa, Aurojit Panda, and Ion Stoica. 2021. Cerebro: A Platform for Multi-Party Cryptographic Collaborative Learning. In USENIX Security."}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Melbourne VIC Australia","acronym":"ASIA CCS '23"},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3590340","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:16Z","timestamp":1750183696000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3590340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":85,"alternative-id":["10.1145\/3579856.3590340","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3590340","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}