default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAner Ben-Efraim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Aner Ben-Efraim, Lior Breitman, Jonathan Bronshtein, Olga Nissenbaum, Eran Omri:
MYao: Multiparty "Yao" Garbled Circuits with Row Reduction, Half Gates, and Efficient Online Computation. IACR Cryptol. ePrint Arch. 2024: 1430 (2024)- 2022
- [c8]Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky:
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. AsiaCCS 2022: 1098-1112 - 2021
- [j3]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): 143-166 (2021) - [c7]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: 33-63 - [i7]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: 120 (2021) - [i6]Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky:
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. IACR Cryptol. ePrint Arch. 2021: 122 (2021) - 2020
- [j2]Frantisek Matús, Aner Ben-Efraim:
A note on representing dowling geometries by partitions. Kybernetika 56(5): 934-947 (2020) - [i5]Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró:
Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. CoRR abs/2002.08108 (2020)
2010 – 2019
- 2019
- [c6]Aner Ben-Efraim, Michael Nielsen, Eran Omri:
Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. ACNS 2019: 530-549 - [i4]Aner Ben-Efraim, Eran Omri:
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing. IACR Cryptol. ePrint Arch. 2019: 80 (2019) - 2018
- [c5]Aner Ben-Efraim:
On Multiparty Garbling of Arithmetic Circuits. ASIACRYPT (3) 2018: 3-33 - 2017
- [c4]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. ASIACRYPT (2) 2017: 471-498 - [c3]Aner Ben-Efraim, Eran Omri:
Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority. LATINCRYPT 2017: 289-308 - [i3]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. IACR Cryptol. ePrint Arch. 2017: 862 (2017) - [i2]Aner Ben-Efraim:
On Multiparty Garbling of Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2017: 1186 (2017) - 2016
- [j1]Aner Ben-Efraim:
Secret-sharing matroids need not be algebraic. Discret. Math. 339(8): 2136-2145 (2016) - [c2]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. CCS 2016: 578-590 - [i1]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptol. ePrint Arch. 2016: 1066 (2016) - 2014
- [c1]Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin:
Multi-linear Secret-Sharing Schemes. TCC 2014: 394-418
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 02:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
