Multi-linear Secret-Sharing Schemes. - Amos Beimel; Aner Ben-Efraim; Carles Padró; Ilya Tyomkin (TCC, 2014)

Secret-sharing matroids need not be algebraic. - Aner Ben-Efraim (Discret. Math., 2016)

Optimizing Semi-Honest Secure Multiparty Computation for the Internet. - Aner Ben-Efraim; Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2016)

Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority. - Aner Ben-Efraim; Eran Omri (LATINCRYPT, 2017)

On Multiparty Garbling of Arithmetic Circuits. - Aner Ben-Efraim (IACR Cryptol. ePrint Arch., 2017)

Efficient Scalable Constant-Round MPC via Garbled Circuits. - Aner Ben-Efraim; Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2017)

Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. - Aner Ben-Efraim; Michael Nielsen 007; Eran Omri (ACNS, 2019)

Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing. - Aner Ben-Efraim; Eran Omri (IACR Cryptol. ePrint Arch., 2019)

A note on representing dowling geometries by partitions. - Frantisek Matús; Aner Ben-Efraim (Kybernetika, 2020)

Common information, matroid representation, and secret sharing for matroid ports. - Michael Bamiloshin; Aner Ben-Efraim; Oriol Farràs; Carles Padró (Des. Codes Cryptogr., 2021)

Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. - Aner Ben-Efraim; Kelong Cong; Eran Omri; Emmanuela Orsini; Nigel P. Smart; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2021)

PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. - Aner Ben-Efraim; Olga Nissenbaum; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2021)

MYao: Multiparty "Yao" Garbled Circuits with Row Reduction, Half Gates, and Efficient Online Computation. - Aner Ben-Efraim; Lior Breitman; Jonathan Bronshtein; Olga Nissenbaum; Eran Omri (IACR Cryptol. ePrint Arch., 2024)