{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:37Z","timestamp":1787017417554,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":98,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"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":[[2021,12,6]]},"DOI":"10.1145\/3485832.3485897","type":"proceedings-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T13:42:32Z","timestamp":1638798152000},"page":"131-145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["VASA: Vector AES Instructions for Security Applications"],"prefix":"10.1145","author":[{"given":"Jean-Pierre","family":"M\u00fcnch","sequence":"first","affiliation":[{"name":"TU Darmstadt"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"TU Darmstadt"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hossein","family":"Yalame","sequence":"additional","affiliation":[{"name":"TU Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,12,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339819"},{"key":"e_1_3_2_1_2_1","volume-title":"Breakthrough AES performance with intel AES new instructions. White paper","author":"Akdemir Kahraman","year":"2010","unstructured":"Kahraman Akdemir, Martin Dixon, Wajdi Feghali, Patrick Fay, Vinodh Gopal, Jim Guilford, Erdinc Ozturk, Gil Wolrich, and Ronen Zohar. 2010. Breakthrough AES performance with intel AES new instructions. White paper (2010). https:\/\/www.intel.ua\/content\/dam\/www\/public\/us\/en\/documents\/white-papers\/aes-breakthrough-performance-paper.pdf."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Martin\u00a0R. Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT.","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_2_1_4_1","unstructured":"MPC Alliance. 2020. MPC Alliance. https:\/\/www.mpcalliance.org\/"},{"key":"e_1_3_2_1_5_1","volume-title":"AMD64 Architecture Programmer\u2019s Manual: Volumes 1-5. Advanced Micro Devices","author":"AMD.","unstructured":"AMD. 2021. AMD64 Architecture Programmer\u2019s Manual: Volumes 1-5. Advanced Micro Devices, Inc. https:\/\/www.amd.com\/system\/files\/TechDocs\/40332.pdf."},{"key":"e_1_3_2_1_6_1","volume-title":"BIKE: Bit Flipping Key Encapsulation.","author":"Aragon Nicolas","year":"2017","unstructured":"Nicolas Aragon, Paulo Barreto, Slim Bettaieb, Lo\u00efc Bidoux, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Shay Gueron, Tim Guneysu, and Carlos\u00a0Aguilar Melchor. 2017. BIKE: Bit Flipping Key Encapsulation. (2017)."},{"key":"e_1_3_2_1_7_1","unstructured":"Arm. 2021. Arm Architecture Reference Manual. Arm Limited. https:\/\/documentation-service.arm.com\/static\/60119835773bb020e3de6fee?token=."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell Thomas Schneider and Michael Zohner. 2013. More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. In CCS.","DOI":"10.1145\/2508859.2516738"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Yehuda Lindell Thomas Schneider and Michael Zohner. 2015. More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. In EUROCRYPT.","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"e_1_3_2_1_10_1","unstructured":"Tomer Ashur Efrat Cohen Carmit Hazay and Avishay Yanai. 2021. A New Framework for Garbled Circuits. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2021\/739."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Mauro Barni Massimo Bernaschi Riccardo Lazzeretti Tommaso Pignata and Alessandro Sabellico. 2014. Parallel Implementation of GC-Based MPC Protocols in the Semi-Honest Setting. In Data Privacy Management and Autonomous Spontaneous Security.","DOI":"10.1007\/978-3-642-54568-9_5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"D. Beaver S. Micali and P. Rogaway. 1990. The Round Complexity of Secure Protocols. In STOC.","DOI":"10.1145\/100216.100287"},{"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.","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Aner Ben-Efraim Yehuda Lindell and Eran Omri. 2016. Optimizing Semi-honest Secure Multiparty Computation for the Internet. In CCS.","DOI":"10.1145\/2976749.2978347"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Fabian Boemer Rosario Cammarota Daniel Demmler Thomas Schneider and Hossein Yalame. 2020. MP2ML: A Mixed-protocol Machine Learning Framework for Private Inference. In ARES.","DOI":"10.1145\/3411501.3419425"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Keith Bonawitz Vladimir Ivanov Ben Kreuter Antonio Marcedone H\u00a0Brendan McMahan Sarvar Patel Daniel Ramage Aaron Segal and Karn Seth. 2017. Practical Secure Aggregation for Privacy-preserving Machine Learning. In CCS.","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Joan Boyar Philip Matthews and Ren\u00e9 Peralta. 2013. Logic Minimization Techniques with Applications to Cryptology. Journal of Cryptology 26(2013).","DOI":"10.1007\/s00145-012-9124-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Peter Rindal and Peter Scholl. 2019. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In CCS.","DOI":"10.1145\/3319535.3354255"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl and Peter Scholl. 2019. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In CRYPTO.","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"e_1_3_2_1_20_1","unstructured":"Niklas Buescher and Stefan Katzenbeisser. 2015. Faster Secure Computation through Automatic Parallelization. In USENIX Security."},{"key":"e_1_3_2_1_21_1","unstructured":"Tom Caputi. 2016. ZFS-Native Encryption. OpenZFS Developer Summit."},{"key":"e_1_3_2_1_22_1","unstructured":"Sergiu Carpov Nicolas Gama Mariya Georgieva and Dimitar Jetchev. 2021. GenoPPML \u2013 A Framework for Genomic Privacy-preserving Machine Learning. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2021\/733."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Tung Chou and Claudio Orlandi. 2015. The Simplest Protocol for Oblivious Transfer. In LATINCRYPT.","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"e_1_3_2_1_24_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.","DOI":"10.1145\/2810103.2813678"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Daniel Demmler Thomas Schneider and Michael Zohner. 2015. ABY\u2013A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS.","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Jintai Ding and Dieter Schmidt. 2005. Rainbow a New Multivariable Polynomial Signature Scheme. In ACNS.","DOI":"10.1007\/11496137_12"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Itai Dinur Daniel Kales Angela Promitzer Sebastian Ramacher and Christian Rechberger. 2019. Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC. In EUROCRYPT.","DOI":"10.1007\/978-3-030-17653-2_12"},{"key":"e_1_3_2_1_28_1","volume-title":"Rasta: A Cipher with Low ANDdepth and few ANDs per Bit. In CRYPTO.","author":"Dobraunig Christoph","year":"2018","unstructured":"Christoph Dobraunig, Maria Eichlseder, Lorenzo Grassi, Virginie Lallemand, Gregor Leander, Eik List, Florian Mendel, and Christian Rechberger. 2018. Rasta: A Cipher with Low ANDdepth and few ANDs per Bit. In CRYPTO."},{"key":"e_1_3_2_1_29_1","unstructured":"Nir Drucker and Shay Gueron. 2019. CTR DRBG with Vector AES NI. Code: https:\/\/github.com\/aws-samples\/ctr-drbg-with-vector-aes-ni."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20951-3_13"},{"key":"e_1_3_2_1_31_1","volume-title":"Speed Up Over the Rainbow. In International Conference on Information Technology-New Generations (ITNG). Springer. Online: https:\/\/ia.cr\/2020\/408","author":"Drucker Nir","year":"2021","unstructured":"Nir Drucker and Shay Gueron. 2021. Speed Up Over the Rainbow. In International Conference on Information Technology-New Generations (ITNG). Springer. Online: https:\/\/ia.cr\/2020\/408."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Nir Drucker Shay Gueron and Dusan Kostic. 2020. QC-MDPC Decoders with Several Shades of Gray. In PQCrypto.","DOI":"10.1007\/978-3-030-44223-1_3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-14070-0_6"},{"key":"e_1_3_2_1_34_1","volume-title":"Special Publication 800-38E: Recommendation for Block Cipher Modes of Operation: the XTS-AES Mode for Confidentiality on Storage Devices","author":"Dworkin Morris","unstructured":"Morris Dworkin. 2010. Special Publication 800-38E: Recommendation for Block Cipher Modes of Operation: the XTS-AES Mode for Confidentiality on Storage Devices. National Institute for Standards and Technology. https:\/\/csrc.nist.gov\/publications\/detail\/sp\/800-38e\/final"},{"key":"e_1_3_2_1_35_1","unstructured":"Intel. 2018. Intel architecture instruction set extensions programming reference. https:\/\/software.intel.com\/sites\/default\/files\/managed\/c5\/15\/architecture-instruction-set-extensions-programming-reference.pdf."},{"key":"e_1_3_2_1_36_1","volume-title":"A Fast Computer Method for Matrix Transposing","author":"Eklundh J.O.","unstructured":"J.O. Eklundh. 1972. A Fast Computer Method for Matrix Transposing. In IEEE Transactions on Computers."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Hossein Fereidooni Samuel Marchal Markus Miettinen Azalia Mirhoseini Helen M\u00f6llering Thien\u00a0Duc Nguyen Phillip Rieger Ahmad\u00a0Reza Sadeghi Thomas Schneider Hossein Yalame and Shaza Zeitouni. 2021. SAFELearn: Secure Aggregation for private FEderated Learning. In DLS.","DOI":"10.1109\/SPW53761.2021.00017"},{"key":"e_1_3_2_1_38_1","unstructured":"Agner Fog. 2021. Lists of instruction latencies throughputs and micro-operation breakdowns for Intel AMD and VIA CPUs. https:\/\/www.agner.org\/optimize\/instruction_tables.pdf."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Thore Graepel Kristin Lauter and Michael Naehrig. 2013. ML Confidential: Machine Learning on Encrypted Data. In ICISC.","DOI":"10.1007\/978-3-642-37682-5_1"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Shay Gueron Yehuda Lindell Ariel Nof and Benny Pinkas. 2015. Fast Garbling of Circuits Under Standard Assumptions. In CCS.","DOI":"10.1145\/2810103.2813619"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Chun Guo Jonathan Katz Xiao Wang Chenkai Weng and Yu Yu. 2020. Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting). In CRYPTO.","DOI":"10.1007\/978-3-030-56880-1_28"},{"key":"e_1_3_2_1_42_1","volume-title":"Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers","author":"Guo Chun","unstructured":"Chun Guo, Jonathan Katz, Xiao Wang, and Yu Yu. 2020. Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers. In IEEE S&P."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"David Heath and Vladimir Kolesnikov. 2020. Stacked Garbling. In CRYPTO.","DOI":"10.1007\/978-3-030-56880-1_27"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"David Heath and Vladimir Kolesnikov. 2020. Stacked Garbling for Disjunctive Zero-Knowledge Proofs. In EUROCRYPT.","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"e_1_3_2_1_45_1","volume-title":"SoK: Efficient Privacy-preserving Clustering. PETS","author":"Hegde Aditya","year":"2021","unstructured":"Aditya Hegde, Helen M\u00f6llering, Thomas Schneider, and Hossein Yalame. 2021. SoK: Efficient Privacy-preserving Clustering. PETS (2021)."},{"key":"e_1_3_2_1_46_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.","DOI":"10.1007\/978-3-030-78375-4_5"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Wilko Henecka and Thomas Schneider. 2013. Faster Secure Two-Party Computation with Less Memory. In ASIACCS.","DOI":"10.1145\/2484313.2484369"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"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_49_1","unstructured":"Yan Huang David Evans and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS."},{"key":"e_1_3_2_1_50_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.","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"e_1_3_2_1_51_1","volume":"201","author":"Huang Yan","unstructured":"Yan Huang, Jonathan Katz, Vladimir Kolesnikov, Ranjit Kumaresan, and Alex\u00a0J. Malozemoff. 2014. Amortizing Garbled Circuits. In CRYPTO.","journal-title":"J. Malozemoff."},{"key":"e_1_3_2_1_52_1","volume-title":"Garble Circuit. In ACM Workshop on Privacy-Preserving Machine Learning in Practice (PPMLP).","author":"Hussain Siam","year":"2020","unstructured":"Siam Hussain, Baiyu Li, Farinaz Koushanfar, and Rosario Cammarota. 2020. TinyGarble2: Smart, Efficient, and Scalable Yao\u2019s Garble Circuit. In ACM Workshop on Privacy-Preserving Machine Learning in Practice (PPMLP)."},{"key":"e_1_3_2_1_53_1","volume-title":"Hussain and Farinaz Koushanfar","author":"U.","year":"2019","unstructured":"Siam\u00a0U. Hussain and Farinaz Koushanfar. 2019. FASE: FPGA Acceleration of Secure Function Evaluation. In FCCM."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Siam\u00a0U. Hussain Bita\u00a0Darvish Rouhani Mohammad Ghasemzadeh and Farinaz Koushanfar. 2018. MAXelerator: FPGA Accelerator for Privacy Preserving Multiply-Accumulate (MAC) on Cloud Servers. In DAC.","DOI":"10.1145\/3195970.3196074"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Nathaniel Husted Steven Myers Abhi Shelat and Paul Grubbs. 2013. GPU and CPU Parallelization of Honest-but-Curious Secure Two-Party Computation. In ACSAC.","DOI":"10.1145\/2523649.2523681"},{"key":"e_1_3_2_1_56_1","unstructured":"Intel. 2021. Intel 64 and IA-32 Architectures Software Developer\u2019s Manual. https:\/\/software.intel.com\/content\/dam\/develop\/external\/us\/en\/documents-tps\/325462-sdm-vol-1-2abcd-3abcd.pdf."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Y. Ishai J. Kilian K. Nissim and E. Petrank. 2003. Extending Oblivious Transfers Efficiently. In CRYPTO.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Kimmo J\u00e4rvinen Vladimir Kolesnikov Ahmad-Reza Sadeghi and Thomas Schneider. 2010. Embedded SFE: Offloading Server and Network Using Hardware Tokens. In FC.","DOI":"10.1007\/978-3-642-14577-3_17"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Kimmo J\u00e4rvinen Vladimir Kolesnikov Ahmad-Reza Sadeghi and Thomas Schneider. 2010. Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs. In CHES.","DOI":"10.1007\/978-3-642-15031-9_26"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Marek Jawurek Florian Kerschbaum and Claudio Orlandi. 2013. Zero-Knowledge Using Garbled Circuits: How to Prove Non-Algebraic Statements Efficiently. In CCS.","DOI":"10.1145\/2508859.2516662"},{"key":"e_1_3_2_1_61_1","unstructured":"Daniel Kales L\u00e9o Perrin Angela Promitzer Sebastian Ramacher and Christian Rechberger. 2017. Improvements to the Linear Operations of LowMC: A Faster Picnic. Cryptology ePrint Archive. https:\/\/ia.cr\/2017\/1148."},{"key":"e_1_3_2_1_62_1","unstructured":"Daniel Kales Christian Rechberger Thomas Schneider Matthias Senker and Christian Weinert. 2019. Mobile Private Contact Discovery at Scale. In USENIX Security."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Emilia K\u00e4sper and Peter Schwabe. 2009. Faster and Timing-Attack Resistant AES-GCM. In CHES.","DOI":"10.1007\/978-3-642-04138-9_1"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"crossref","unstructured":"Hannah Keller Helen M\u00f6llering Thomas Schneider and Hossein Yalame. 2021. Balancing Quality and Efficiency in Private Clustering with Affinity Propagation. In SECRYPT.","DOI":"10.5220\/0010547801730184"},{"key":"e_1_3_2_1_65_1","volume-title":"Private Set Intersection for Unequal Set Sizes with Mobile Applications. PETS","author":"Kiss \u00c1gnes","year":"2017","unstructured":"\u00c1gnes Kiss, Jian Liu, Thomas Schneider, N Asokan, and Benny Pinkas. 2017. Private Set Intersection for Unequal Set Sizes with Mobile Applications. PETS (2017)."},{"key":"e_1_3_2_1_66_1","volume-title":"van\u00a0der Maaten","author":"Knott B.","year":"2021","unstructured":"B. Knott, S. Venkataraman, A.Y. Hannun, S. Sengupta, M. Ibrahim, and L.J.P. van\u00a0der Maaten. 2021. CrypTen: Secure Multi-Party Computation Meets Machine Learning. In arXiv 2109.00984."},{"key":"e_1_3_2_1_67_1","unstructured":"Vladimir Kolesnikov and Thomas Schneider. 2008. Improved Garbled Circuit: Free XOR Gates and Applications. In ICALP."},{"key":"e_1_3_2_1_68_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."},{"key":"e_1_3_2_1_69_1","volume-title":"CrypTFlow: Secure TensorFlow Inference","author":"Kumar Nishant","unstructured":"Nishant Kumar, Mayank Rathee, Nishanth Chandran, Divya Gupta, Aseem Rastogi, and Rahul Sharma. 2020. CrypTFlow: Secure TensorFlow Inference. In IEEE S&P."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Yehuda Lindell and Benny Pinkas. 2008. A Proof of Security of Yao\u2019s Protocol for Two-Party Computation. Journal of Cryptology(2008).","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_71_1","volume-title":"Lonvick and Tatu Ylonen","author":"M.","year":"2006","unstructured":"Chris\u00a0M. Lonvick and Tatu Ylonen. 2006. The Secure Shell (SSH) Transport Layer Protocol. RFC 4253. https:\/\/rfc-editor.org\/rfc\/rfc4253.txt"},{"key":"e_1_3_2_1_72_1","unstructured":"Microsoft and Contributors. 2019. Transparent Data Encryption (TDE). https:\/\/docs.microsoft.com\/en-us\/sql\/relational-databases\/security\/encryption\/transparent-data-encryption?view=sql-server-ver15"},{"key":"e_1_3_2_1_73_1","volume-title":"Practical Privacy-preserving K-means Clustering. PETS","author":"Mohassel Payman","year":"2020","unstructured":"Payman Mohassel, Mike Rosulek, and Ni Trieu. 2020. Practical Privacy-preserving K-means Clustering. PETS (2020)."},{"key":"e_1_3_2_1_74_1","volume-title":"Efficient Oblivious Transfer Protocols","author":"Naor Moni","unstructured":"Moni Naor and Benny Pinkas. 2001. Efficient Oblivious Transfer Protocols. In Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_75_1","volume-title":"Privacy Preserving Auctions and Mechanism Design. In ACM conference on Electronic commerce.","author":"Naor Moni","year":"1999","unstructured":"Moni Naor, Benny Pinkas, and Reuban Sumner. 1999. Privacy Preserving Auctions and Mechanism Design. In ACM conference on Electronic commerce."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"Jesper\u00a0Buus Nielsen and Claudio Orlandi. 2009. LEGO for Two-Party Secure Computation. In TCC.","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"crossref","unstructured":"Jesper\u00a0Buus Nielsen and Claudio Orlandi. 2016. Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In TCC.","DOI":"10.1007\/978-3-662-53641-4_22"},{"key":"e_1_3_2_1_78_1","unstructured":"Arpita Patra Thomas Schneider Ajith Suresh and Hossein Yalame. 2021. ABY2.0: Improved mixed-protocol secure two-party computation. In USENIX Security."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"crossref","unstructured":"Arpita Patra Thomas Schneider Ajith Suresh and Hossein Yalame. 2021. SynCirc: Efficient Synthesis of Depth-OptimizedCircuits for Secure Computation. In HOST.","DOI":"10.1109\/HOST49136.2021.9702293"},{"key":"e_1_3_2_1_80_1","volume-title":"Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security.","author":"Pinkas Benny","year":"2015","unstructured":"Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. 2015. Phasing: Private Set Intersection Using Permutation-based Hashing. In USENIX Security."},{"key":"e_1_3_2_1_81_1","volume-title":"Smart, and Stephen\u00a0C. Williams","author":"Pinkas Benny","year":"2009","unstructured":"Benny Pinkas, Thomas Schneider, Nigel\u00a0P. Smart, and Stephen\u00a0C. Williams. 2009. Secure Two-Party Computation Is Practical. In ASIACRYPT."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"crossref","unstructured":"Deevashwer Rathee Mayank Rathee Nishant Kumar Nishanth Chandran Divya Gupta Aseem Rastogi and Rahul Sharma. 2020. CrypTFlow2: Practical 2-Party Secure Inference. In CCS.","DOI":"10.1145\/3372297.3417274"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"crossref","unstructured":"Eric Rescorla. 2018. The Transport Layer Security (TLS) Protocol Version 1.3. RFC 8446. https:\/\/rfc-editor.org\/rfc\/rfc8446.txt","DOI":"10.17487\/RFC8446"},{"key":"e_1_3_2_1_84_1","volume-title":"XONN: XNOR-Based Oblivious Deep Neural Network Inference. In USENIX Security.","author":"Riazi Sadegh","year":"2019","unstructured":"M.\u00a0Sadegh Riazi, Mohammad Samragh, Hao Chen, Kim Laine, Kristin Lauter, and Farinaz Koushanfar. 2019. XONN: XNOR-Based Oblivious Deep Neural Network Inference. In USENIX Security."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"crossref","unstructured":"Mike Rosulek and Lawrence Roy. 2021. Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits. In CRYPTO.","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"crossref","unstructured":"Palash Sarkar. 2008. A General Mixing Strategy for the ECB-Mix-ECB Mode of Operation. In Information Processing Letters. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019008002652","DOI":"10.1016\/j.ipl.2008.09.012"},{"key":"e_1_3_2_1_87_1","volume-title":"TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits","author":"Songhori M.","unstructured":"Ebrahim\u00a0M. Songhori, Siam\u00a0U. Hussain, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. 2015. TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. In IEEE S&P."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"crossref","unstructured":"Ebrahim\u00a0M. Songhori Shaza Zeitouni Ghada Dessouky Thomas Schneider Ahmad-Reza Sadeghi and Farinaz Koushanfar. 2016. GarbledCPU: A MIPS Processor for Secure Computation in Hardware. In DAC.","DOI":"10.1145\/2897937.2898027"},{"key":"e_1_3_2_1_89_1","unstructured":"The OpenSSL Project. 2003. OpenSSL: The Open Source toolkit for SSL\/TLS. www.openssl.org."},{"key":"e_1_3_2_1_90_1","unstructured":"Xiao Wang Alex\u00a0J. Malozemoff and Jonathan Katz. 2016. EMP-toolkit: Efficient MultiParty Computation Toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_91_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. In CCS.","DOI":"10.1145\/3133956.3134053"},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Samuel Ranellucci and Jonathan Katz. 2017. Global-Scale Secure Multiparty Computation. In CCS.","DOI":"10.1145\/3133956.3133979"},{"key":"e_1_3_2_1_93_1","volume-title":"Ferret: Fast Extension for Correlated OT with Small Communication. In CCS.","author":"Yang Kang","year":"2020","unstructured":"Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. 2020. Ferret: Fast Extension for Correlated OT with Small Communication. In CCS."},{"key":"e_1_3_2_1_94_1","unstructured":"Andrew\u00a0C. Yao. 1982. Protocols for secure computations. In FOCS."},{"key":"e_1_3_2_1_95_1","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In FOCS."},{"key":"e_1_3_2_1_96_1","unstructured":"Samee Zahur and David Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2015\/1153."},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Mike Rosulek and David Evans. 2015. Two halves make a whole: Reducing data transfer in garbled circuits using half gates. In EUROCRYPT.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"e_1_3_2_1_98_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."}],"event":{"name":"ACSAC '21: Annual Computer Security Applications Conference","location":"Virtual Event USA","acronym":"ACSAC '21"},"container-title":["Annual Computer Security Applications Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485832.3485897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485832.3485897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T19:19:16Z","timestamp":1755890356000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485832.3485897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,6]]},"references-count":98,"alternative-id":["10.1145\/3485832.3485897","10.1145\/3485832"],"URL":"https:\/\/doi.org\/10.1145\/3485832.3485897","relation":{},"subject":[],"published":{"date-parts":[[2021,12,6]]},"assertion":[{"value":"2021-12-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}