| 2026 | AsiaCCS | MYao: Efficient Multiparty "Yao" Garbled Circuits with Row Reduction and Half Gates. | Aner Ben-Efraim, Lior Breitman, Jonathan Bronshtein, Olga Nissenbaum, Eran Omri |
| 2024 | CRYPTO | MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. | Bar Alon, Moni Naor, Eran Omri, Uri Stemmer |
| 2024 | EuroCrypt | Can Alice and Bob Guarantee Output to Carol? | Bar Alon, Eran Omri, Muthuramakrishnan Venkitasubramaniam |
| 2024 | TCC | New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. | Bar Alon, Amos Beimel, Tamar Ben David, Eran Omri, Anat Paskin-Cherniavsky |
| 2023 | TCC | Three Party Secure Computation with Friends and Foes. | Bar Alon, Amos Beimel, Eran Omri |
| 2023 | TCC | On Secure Computation of Solitary Output Functionalities with and Without Broadcast. | Bar Alon, Eran Omri |
| 2022 | AsiaCCS | PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. | Aner Ben-Efraim, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky |
| 2022 | TCC | On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. | Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra |
| 2021 | EuroCrypt | Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits. | Aner Ben-Efraim, Kelong Cong, Eran Omri, Emmanuela Orsini, Nigel P. Smart, Eduardo Soria-Vazquez |
| 2020 | CRYPTO | MPC with Friends and Foes. | Bar Alon, Eran Omri, Anat Paskin-Cherniavsky |
| 2020 | TCC | On the Power of an Honest Majority in Three-Party Computation Without Broadcast. | Bar Alon, Ran Cohen, Eran Omri, Tom Suad |
| 2019 | ACNS | Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. | Aner Ben-Efraim, Michael Nielsen, Eran Omri |
| 2018 | FOCS | Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. | Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri |
| 2018 | FOCS | Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. | Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak |
| 2018 | SCN | From Fairness to Full Security in Multiparty Computation. | Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem |
| 2018 | SCN | Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. | Roi Inbar, Eran Omri, Benny Pinkas |
| 2018 | TCC | On the Complexity of Fair Coin Flipping. | Iftach Haitner, Nikolaos Makriyannis, Eran Omri |
| 2017 | ASIACRYPT | Efficient Scalable Constant-Round MPC via Garbled Circuits. | Aner Ben-Efraim, Yehuda Lindell, Eran Omri |
| 2016 | CCS | Optimizing Semi-Honest Secure Multiparty Computation for the Internet. | Aner Ben-Efraim, Yehuda Lindell, Eran Omri |
| 2016 | TCC | Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. | Bar Alon, Eran Omri |
| 2016 | TCC | Characterization of Secure Multiparty Computation Without Broadcast. | Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem |
| 2015 | CRYPTO | Parallel Hashing via List Recoverability. | Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel |
| 2015 | TCC | Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. | Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri |
| 2013 | TCC | Limits on the Usefulness of Random Oracles. | Iftach Haitner, Eran Omri, Hila Zarosim |
| 2012 | ASIACRYPT | Completeness for Symmetric Two-Party Functionalities - Revisited. | Yehuda Lindell, Eran Omri, Hila Zarosim |
| 2011 | CRYPTO | 1/ | Amos Beimel, Yehuda Lindell, Eran Omri, Ilan Orlov |
| 2011 | FOCS | Coin Flipping with Constant Bias Implies One-Way Functions. | Iftach Haitner, Eran Omri |
| 2010 | CRYPTO | Protocols for Multiparty Coin Toss with Dishonest Majority. | Amos Beimel, Eran Omri, Ilan Orlov |
| 2008 | CRYPTO | Distributed Private Data Analysis: Simultaneously Solving How and What. | Amos Beimel, Kobbi Nissim, Eran Omri |