Aner Ben-Efraim

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