default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEran Omri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j19]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis
, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. SIAM J. Comput. 53(5): 1381-1408 (2024)- [c30]Bar Alon, Moni Naor, Eran Omri, Uri Stemmer:
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CRYPTO (8) 2024: 74-108 - [c29]Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam:
Can Alice and Bob Guarantee Output to Carol? EUROCRYPT (5) 2024: 32-61 - [c28]Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar:
PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector. USENIX Security Symposium 2024 - [i38]Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky:
New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. IACR Cryptol. ePrint Arch. 2024: 419 (2024) - [i37]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) - 2023
- [j18]Bar Alon, Eran Omri:
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. J. Cryptol. 36(3): 24 (2023) - [j17]Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. J. Cryptol. 36(3): 25 (2023) - [c27]Bar Alon, Eran Omri:
On Secure Computation of Solitary Output Functionalities with and Without Broadcast. TCC (2) 2023: 94-123 - [c26]Bar Alon, Amos Beimel, Eran Omri:
Three Party Secure Computation with Friends and Foes. TCC (2) 2023: 156-185 - [i36]Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar:
PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors. CoRR abs/2311.10237 (2023) - [i35]Bar Alon, Amos Beimel, Eran Omri:
Three Party Secure Computation with Friends and Foes. IACR Cryptol. ePrint Arch. 2023: 1605 (2023) - [i34]Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam:
Can Alice and Bob Guarantee Output to Carol? IACR Cryptol. ePrint Arch. 2023: 1608 (2023) - 2022
- [j16]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35(1): 4 (2022) - [j15]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. SIAM J. Comput. 51(4): 1126-1171 (2022) - [j14]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the complexity of fair coin flipping. Theor. Comput. Sci. 914: 23-38 (2022) - [c25]Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky:
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. AsiaCCS 2022: 1098-1112 - [c24]Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. TCC (2) 2022: 532-561 - [i33]Bar Alon, Moni Naor, Eran Omri, Uri Stemmer:
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CoRR abs/2207.05047 (2022) - [i32]Bar Alon, Moni Naor, Eran Omri, Uri Stemmer:
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. IACR Cryptol. ePrint Arch. 2022: 902 (2022) - [i31]Bar Alon, Eran Omri:
On Secure Computation of Solitary Output Functionalities With and Without Broadcast. IACR Cryptol. ePrint Arch. 2022: 934 (2022) - [i30]Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. IACR Cryptol. ePrint Arch. 2022: 1504 (2022) - 2021
- [c23]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 - [i29]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. CoRR abs/2105.00732 (2021) - [i28]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR abs/2105.00743 (2021) - [i27]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR abs/2105.00765 (2021) - [i26]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. CoRR abs/2105.00780 (2021) - [i25]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. CoRR abs/2105.00962 (2021) - [i24]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) - [i23]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
- [j13]Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. J. Cryptol. 33(4): 1659-1731 (2020) - [j12]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. SIAM J. Comput. 49(6): 1041-1082 (2020) - [c22]Bar Alon, Eran Omri, Anat Paskin-Cherniavsky:
MPC with Friends and Foes. CRYPTO (2) 2020: 677-706 - [c21]Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. TCC (2) 2020: 621-651 - [i22]Bar Alon, Eran Omri, Anat Paskin-Cherniavsky:
MPC with Friends and Foes. IACR Cryptol. ePrint Arch. 2020: 701 (2020) - [i21]Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2020: 1170 (2020)
2010 – 2019
- 2019
- [c20]Aner Ben-Efraim, Michael Nielsen, Eran Omri:
Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. ACNS 2019: 530-549 - [i20]Aner Ben-Efraim, Eran Omri:
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing. IACR Cryptol. ePrint Arch. 2019: 80 (2019) - [i19]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019: 1344 (2019) - 2018
- [j11]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31(2): 587-609 (2018) - [j10]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities: Revisited. J. Cryptol. 31(3): 671-697 (2018) - [c19]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018: 136-147 - [c18]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS 2018: 838-849 - [c17]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
From Fairness to Full Security in Multiparty Computation. SCN 2018: 216-234 - [c16]Roi Inbar, Eran Omri, Benny Pinkas:
Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. SCN 2018: 235-252 - [c15]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. TCC (1) 2018: 539-562 - [i18]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. Electron. Colloquium Comput. Complex. TR18 (2018) - [i17]Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak:
Computational Two-Party Correlation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. IACR Cryptol. ePrint Arch. 2018: 901 (2018) - 2017
- [j9]Gabriel Nivasch, Eran Omri:
Rainbow Matchings and Algebras of Sets. Graphs Comb. 33(2): 473-484 (2017) - [c14]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. ASIACRYPT (2) 2017: 471-498 - [c13]Aner Ben-Efraim, Eran Omri:
Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority. LATINCRYPT 2017: 289-308 - [i15]Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. Electron. Colloquium Comput. Complex. TR17 (2017) - [i14]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Efficient Scalable Constant-Round MPC via Garbled Circuits. IACR Cryptol. ePrint Arch. 2017: 862 (2017) - 2016
- [j8]Iftach Haitner, Eran Omri, Hila Zarosim:
Limits on the Usefulness of Random Oracles. J. Cryptol. 29(2): 283-335 (2016) - [j7]Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb, Eran Omri:
Optimizing budget allocation for center and median points. Theor. Comput. Sci. 627: 13-25 (2016) - [c12]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. CCS 2016: 578-590 - [c11]Bar Alon, Eran Omri:
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. TCC (B1) 2016: 307-335 - [c10]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) 2016: 596-616 - [i13]Bar Alon, Eran Omri:
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. IACR Cryptol. ePrint Arch. 2016: 800 (2016) - [i12]Aner Ben-Efraim, Yehuda Lindell, Eran Omri:
Optimizing Semi-Honest Secure Multiparty Computation for the Internet. IACR Cryptol. ePrint Arch. 2016: 1066 (2016) - 2015
- [j6]Gabriel Nivasch, Eran Omri:
Rainbow matchings and algebras of sets. Electron. Notes Discret. Math. 49: 251-257 (2015) - [j5]Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss with a Dishonest Majority. J. Cryptol. 28(3): 551-600 (2015) - [c9]Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel:
Parallel Hashing via List Recoverability. CRYPTO (2) 2015: 173-190 - [c8]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) 2015: 199-228 - [i11]Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015: 846 (2015) - 2014
- [j4]Iftach Haitner, Eran Omri:
Coin Flipping with Constant Bias Implies One-Way Functions. SIAM J. Comput. 43(2): 389-409 (2014) - [i10]Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb, Eran Omri:
Optimizing Budget Allocation in Graphs. CoRR abs/1406.2107 (2014) - [i9]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities - Revisited. IACR Cryptol. ePrint Arch. 2014: 18 (2014) - [i8]Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. IACR Cryptol. ePrint Arch. 2014: 1000 (2014) - 2013
- [c7]Iftach Haitner, Eran Omri, Hila Zarosim:
Limits on the Usefulness of Random Oracles. TCC 2013: 437-456 - 2012
- [c6]Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities - Revisited. ASIACRYPT 2012: 116-133 - [i7]Iftach Haitner, Eran Omri, Hila Zarosim:
On the Power of Random Oracles. Electron. Colloquium Comput. Complex. TR12 (2012) - [i6]Iftach Haitner, Eran Omri, Hila Zarosim:
On the Power of Random Oracles. IACR Cryptol. ePrint Arch. 2012: 573 (2012) - [i5]Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss With Dishonest Majority. IACR Cryptol. ePrint Arch. 2012: 643 (2012) - 2011
- [c5]Boaz Ben-Moshe, Eran Omri, Michael Elkin:
Optimizing Budget Allocation in Graphs. CCCG 2011 - [c4]Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov:
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO 2011: 277-296 - [c3]Iftach Haitner, Eran Omri:
Coin Flipping with Constant Bias Implies One-Way Functions. FOCS 2011: 110-119 - [i4]Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: On Simultaneously Solving How and What. CoRR abs/1103.2626 (2011) - [i3]Yehuda Lindell, Eran Omri:
A Practical Application of Differential Privacy to Personalized Online Advertising. IACR Cryptol. ePrint Arch. 2011: 152 (2011) - 2010
- [c2]Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss with Dishonest Majority. CRYPTO 2010: 538-557 - [i2]Amos Beimel, Eran Omri, Ilan Orlov:
Secure Multiparty Computation with Partial Fairness. CoRR abs/1011.5567 (2010) - [i1]Amos Beimel, Eran Omri, Ilan Orlov:
Secure Multiparty Computation with Partial Fairness. IACR Cryptol. ePrint Arch. 2010: 599 (2010)
2000 – 2009
- 2009
- [j3]Eran Omri, Andreas Weiermann:
Classifying the phase transition threshold for Ackermannian functions. Ann. Pure Appl. Log. 158(3): 156-162 (2009) - [j2]Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri:
Matrix columns allocation problems. Theor. Comput. Sci. 410(21-23): 2174-2183 (2009) - 2008
- [j1]Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann:
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. J. Comb. Theory A 115(6): 1036-1055 (2008) - [c1]Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468
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-11-07 21:29 CET 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:
