Aner Ben-Efraim

Publication Activity (10 Years)

Years Active: 2014-2022
Publications (10 Years): 17

Top Topics

Efficient Search

Human Communication

Top Venues

IACR Cryptol. ePrint Arch.

Des. Codes Cryptogr.

Publications

Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. AsiaCCS (2022)
Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. IACR Cryptol. ePrint Arch. 2021 (2021)
Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró
Common information, matroid representation, and secret sharing for matroid ports. Des. Codes Cryptogr. 89 (1) (2021)
Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. EUROCRYPT (3) (2021)
Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. IACR Cryptol. ePrint Arch. 2021 (2021)
Frantisek Matús, Aner Ben-Efraim
A note on representing dowling geometries by partitions. Kybernetika 56 (5) (2020)
Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró
Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. CoRR (2020)
Aner Ben-Efraim, Michael Nielsen, Eran Omri
Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. ACNS (2019)
Aner Ben-Efraim, Eran Omri
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing. IACR Cryptol. ePrint Arch. 2019 (2019)
Aner Ben-Efraim
On Multiparty Garbling of Arithmetic Circuits. ASIACRYPT (3) (2018)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Efficient Scalable Constant-Round MPC via Garbled Circuits. IACR Cryptol. ePrint Arch. 2017 (2017)
Aner Ben-Efraim, Eran Omri
Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority. LATINCRYPT (2017)
Aner Ben-Efraim
On Multiparty Garbling of Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2017 (2017)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Efficient Scalable Constant-Round MPC via Garbled Circuits. ASIACRYPT (2) (2017)
Aner Ben-Efraim
Secret-sharing matroids need not be algebraic. Discret. Math. 339 (8) (2016)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptol. ePrint Arch. 2016 (2016)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. CCS (2016)
Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin
Multi-linear Secret-Sharing Schemes. TCC (2014)