Eran Omri

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 59

Top Topics

Set Intersection

Differentially Private

Secure Multiparty Computation

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CRYPTO (8) (2024)
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 (2024)
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)
Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam
Can Alice and Bob Guarantee Output to Carol? EUROCRYPT (5) (2024)
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) (2023)
Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam
Can Alice and Bob Guarantee Output to Carol? IACR Cryptol. ePrint Arch. 2023 (2023)
Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar
PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors. CoRR (2023)
Bar Alon, Amos Beimel, Eran Omri
Three Party Secure Computation with Friends and Foes. TCC (2) (2023)
Bar Alon, Eran Omri
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. J. Cryptol. 36 (3) (2023)
Bar Alon, Eran Omri
On Secure Computation of Solitary Output Functionalities with and Without Broadcast. TCC (2) (2023)
Bar Alon, Amos Beimel, Eran Omri
Three Party Secure Computation with Friends and Foes. IACR Cryptol. ePrint Arch. 2023 (2023)
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) (2022)
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 (2022)
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 (2022)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. J. Cryptol. 35 (1) (2022)
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)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the complexity of fair coin flipping. Theor. Comput. Sci. 914 (2022)
Bar Alon, Eran Omri
On Secure Computation of Solitary Output Functionalities With and Without Broadcast. IACR Cryptol. ePrint Arch. 2022 (2022)
Bar Alon, Moni Naor, Eran Omri, Uri Stemmer
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. CoRR (2022)
Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky
PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. AsiaCCS (2022)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. CoRR (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. CoRR (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. IACR Cryptol. ePrint Arch. 2021 (2021)
Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. CoRR (2021)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. CoRR (2021)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. CoRR (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)
Bar Alon, Ran Cohen, Eran Omri, Tom Suad
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. TCC (2) (2020)
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) (2020)
Bar Alon, Eran Omri, Anat Paskin-Cherniavsky
MPC with Friends and Foes. CRYPTO (2) (2020)
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 (2020)
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) (2020)
Bar Alon, Eran Omri, Anat Paskin-Cherniavsky
MPC with Friends and Foes. IACR Cryptol. ePrint Arch. 2020 (2020)
Aner Ben-Efraim, Michael Nielsen, Eran Omri
Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. ACNS (2019)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Aner Ben-Efraim, Eran Omri
Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing. IACR Cryptol. ePrint Arch. 2019 (2019)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptol. 31 (2) (2018)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS (2018)
Roi Inbar, Eran Omri, Benny Pinkas
Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. SCN (2018)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. IACR Cryptol. ePrint Arch. 2018 (2018)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. TCC (1) (2018)
Yehuda Lindell, Eran Omri, Hila Zarosim
Completeness for Symmetric Two-Party Functionalities: Revisited. J. Cryptol. 31 (3) (2018)
Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak
Computational Two-Party Correlation. Electron. Colloquium Comput. Complex. 25 (2018)
Iftach Haitner, Nikolaos Makriyannis, Eran Omri
On the Complexity of Fair Coin Flipping. Electron. Colloquium Comput. Complex. 25 (2018)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
From Fairness to Full Security in Multiparty Computation. SCN (2018)
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)
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)
Gabriel Nivasch, Eran Omri
Rainbow Matchings and Algebras of Sets. Graphs Comb. 33 (2) (2017)
Aner Ben-Efraim, Yehuda Lindell, Eran Omri
Efficient Scalable Constant-Round MPC via Garbled Circuits. ASIACRYPT (2) (2017)
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. 24 (2017)
Bar Alon, Eran Omri
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. TCC (B1) (2016)
Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb, Eran Omri
Optimizing budget allocation for center and median points. Theor. Comput. Sci. 627 (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)
Bar Alon, Eran Omri
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. IACR Cryptol. ePrint Arch. 2016 (2016)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. TCC (A1) (2016)
Iftach Haitner, Eran Omri, Hila Zarosim
Limits on the Usefulness of Random Oracles. J. Cryptol. 29 (2) (2016)
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
Characterization of Secure Multiparty Computation Without Broadcast. IACR Cryptol. ePrint Arch. 2015 (2015)
Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) (2015)
Amos Beimel, Eran Omri, Ilan Orlov
Protocols for Multiparty Coin Toss with a Dishonest Majority. J. Cryptol. 28 (3) (2015)
Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel
Parallel Hashing via List Recoverability. CRYPTO (2) (2015)
Gabriel Nivasch, Eran Omri
Rainbow matchings and algebras of sets. Electron. Notes Discret. Math. 49 (2015)
Iftach Haitner, Eran Omri
Coin Flipping with Constant Bias Implies One-Way Functions. SIAM J. Comput. 43 (2) (2014)
Boaz Ben-Moshe, Michael Elkin, Lee-Ad Gottlieb, Eran Omri
Optimizing Budget Allocation in Graphs. CoRR (2014)
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 (2014)
Yehuda Lindell, Eran Omri, Hila Zarosim
Completeness for Symmetric Two-Party Functionalities - Revisited. IACR Cryptol. ePrint Arch. 2014 (2014)
Iftach Haitner, Eran Omri, Hila Zarosim
Limits on the Usefulness of Random Oracles. TCC (2013)
Yehuda Lindell, Eran Omri, Hila Zarosim
Completeness for Symmetric Two-Party Functionalities - Revisited. ASIACRYPT (2012)
Amos Beimel, Eran Omri, Ilan Orlov
Protocols for Multiparty Coin Toss With Dishonest Majority. IACR Cryptol. ePrint Arch. 2012 (2012)
Iftach Haitner, Eran Omri, Hila Zarosim
On the Power of Random Oracles. IACR Cryptol. ePrint Arch. 2012 (2012)
Iftach Haitner, Eran Omri, Hila Zarosim
On the Power of Random Oracles. Electron. Colloquium Comput. Complex. 19 (2012)
Boaz Ben-Moshe, Eran Omri, Michael Elkin
Optimizing Budget Allocation in Graphs. CCCG (2011)
Yehuda Lindell, Eran Omri
A Practical Application of Differential Privacy to Personalized Online Advertising. IACR Cryptol. ePrint Arch. 2011 (2011)
Iftach Haitner, Eran Omri
Coin Flipping with Constant Bias Implies One-Way Functions. FOCS (2011)
Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov
-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. CRYPTO (2011)
Amos Beimel, Kobbi Nissim, Eran Omri
Distributed Private Data Analysis: On Simultaneously Solving How and What CoRR (2011)
Amos Beimel, Eran Omri, Ilan Orlov
Protocols for Multiparty Coin Toss with Dishonest Majority. CRYPTO (2010)
Amos Beimel, Eran Omri, Ilan Orlov
Secure Multiparty Computation with Partial Fairness. IACR Cryptol. ePrint Arch. 2010 (2010)
Amos Beimel, Eran Omri, Ilan Orlov
Secure Multiparty Computation with Partial Fairness CoRR (2010)
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) (2009)
Eran Omri, Andreas Weiermann
Classifying the phase transition threshold for Ackermannian functions. Ann. Pure Appl. Log. 158 (3) (2009)
Menachem Kojman, Gyesik Lee, Eran Omri, Andreas Weiermann
Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. J. Comb. Theory, Ser. A 115 (6) (2008)
Amos Beimel, Kobbi Nissim, Eran Omri
Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO (2008)