Distributed Private Data Analysis: Simultaneously Solving How and What. - Amos Beimel; Kobbi Nissim; Eran Omri (CRYPTO, 2008)

Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. - Menachem Kojman; Gyesik Lee; Eran Omri; Andreas Weiermann (J. Comb. Theory A, 2008)

Classifying the phase transition threshold for Ackermannian functions. - Eran Omri; Andreas Weiermann (Ann. Pure Appl. Log., 2009)

Matrix columns allocation problems. - Amos Beimel; Boaz Ben-Moshe; Yehuda Ben-Shimol; Paz Carmi; Eldad Chai; Itzik Kitroser; Eran Omri (Theor. Comput. Sci., 2009)

Secure Multiparty Computation with Partial Fairness. - Amos Beimel; Eran Omri; Ilan Orlov (IACR Cryptol. ePrint Arch., 2010)

Optimizing Budget Allocation in Graphs. - Boaz Ben-Moshe; Eran Omri; Michael Elkin (CCCG, 2011)

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds. - Amos Beimel; Yehuda Lindell; Eran Omri; Ilan Orlov (CRYPTO, 2011)

A Practical Application of Differential Privacy to Personalized Online Advertising. - Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2011)

On the Power of Random Oracles. - Iftach Haitner; Eran Omri; Hila Zarosim (Electron. Colloquium Comput. Complex., 2012)

Optimizing Budget Allocation in Graphs. - Boaz Ben-Moshe; Michael Elkin; Lee-Ad Gottlieb; Eran Omri (CoRR, 2014)

Coin Flipping with Constant Bias Implies One-Way Functions. - Iftach Haitner; Eran Omri (SIAM J. Comput., 2014)

Parallel Hashing via List Recoverability. - Iftach Haitner; Yuval Ishai; Eran Omri; Ronen Shaltiel (CRYPTO (2), 2015)

Rainbow matchings and algebras of sets. - Gabriel Nivasch; Eran Omri (Electron. Notes Discret. Math., 2015)

Protocols for Multiparty Coin Toss with a Dishonest Majority. - Amos Beimel; Eran Omri; Ilan Orlov (J. Cryptol., 2015)

Optimizing Semi-Honest Secure Multiparty Computation for the Internet. - Aner Ben-Efraim; Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2016)

Limits on the Usefulness of Random Oracles. - Iftach Haitner; Eran Omri; Hila Zarosim (J. Cryptol., 2016)

Optimizing budget allocation for center and median points. - Boaz Ben-Moshe; Michael Elkin; Lee-Ad Gottlieb; Eran Omri (Theor. Comput. Sci., 2016)

Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority. - Aner Ben-Efraim; Eran Omri (LATINCRYPT, 2017)

Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. - Amos Beimel; Iftach Haitner; Nikolaos Makriyannis; Eran Omri (Electron. Colloquium Comput. Complex., 2017)

Efficient Scalable Constant-Round MPC via Garbled Circuits. - Aner Ben-Efraim; Yehuda Lindell; Eran Omri (IACR Cryptol. ePrint Arch., 2017)

Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. - Amos Beimel; Iftach Haitner; Nikolaos Makriyannis; Eran Omri (FOCS, 2018)

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters. - Roi Inbar; Eran Omri; Benny Pinkas (SCN, 2018)

Computational Two-Party Correlation. - Iftach Haitner; Kobbi Nissim; Eran Omri; Ronen Shaltiel; Jad Silbak (Electron. Colloquium Comput. Complex., 2018)

Characterization of Secure Multiparty Computation Without Broadcast. - Ran Cohen; Iftach Haitner; Eran Omri; Lior Rotem (J. Cryptol., 2018)

Completeness for Symmetric Two-Party Functionalities: Revisited. - Yehuda Lindell; Eran Omri; Hila Zarosim (J. Cryptol., 2018)

Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. - Aner Ben-Efraim; Michael Nielsen 007; Eran Omri (ACNS, 2019)

Turbospeedz: Double Your Online SPDZ! Improving SPDZ using Function Dependent Preprocessing. - Aner Ben-Efraim; Eran Omri (IACR Cryptol. ePrint Arch., 2019)

MPC with Friends and Foes. - Bar Alon; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2020)

1/p-Secure Multiparty Computation without an Honest Majority and the Best of Both Worlds. - Amos Beimel; Yehuda Lindell; Eran Omri; Ilan Orlov (J. Cryptol., 2020)

Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. - Iftach Haitner; Kobbi Nissim; Eran Omri; Ronen Shaltiel; Jad Silbak (SIAM J. Comput., 2020)

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 (IACR Cryptol. ePrint Arch., 2021)

PSImple: Practical Multiparty Maliciously-Secure Private Set Intersection. - Aner Ben-Efraim; Olga Nissenbaum; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2021)

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. - Bar Alon; Olga Nissenbaum; Eran Omri; Anat Paskin-Cherniavsky; Arpita Patra (IACR Cryptol. ePrint Arch., 2022)

MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably. - Bar Alon; Moni Naor; Eran Omri; Uri Stemmer (IACR Cryptol. ePrint Arch., 2022)

On Secure Computation of Solitary Output Functionalities With and Without Broadcast. - Bar Alon; Eran Omri (IACR Cryptol. ePrint Arch., 2022)

From Fairness to Full Security in Multiparty Computation. - Ran Cohen; Iftach Haitner; Eran Omri; Lior Rotem (J. Cryptol., 2022)

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. - Amos Beimel; Iftach Haitner; Nikolaos Makriyannis; Eran Omri (SIAM J. Comput., 2022)

On the complexity of fair coin flipping. - Iftach Haitner; Nikolaos Makriyannis; Eran Omri (Theor. Comput. Sci., 2022)

PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors. - Guy N. Rothblum; Eran Omri; Junye Chen; Kunal Talwar (CoRR, 2023)

Three Party Secure Computation with Friends and Foes. - Bar Alon; Amos Beimel; Eran Omri (IACR Cryptol. ePrint Arch., 2023)

Can Alice and Bob Guarantee Output to Carol? - Bar Alon; Eran Omri; Muthuramakrishnan Venkitasubramaniam (IACR Cryptol. ePrint Arch., 2023)

On the Power of an Honest Majority in Three-Party Computation Without Broadcast. - Bar Alon; Ran Cohen; Eran Omri; Tom Suad (J. Cryptol., 2023)

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. - Bar Alon; Eran Omri (J. Cryptol., 2023)

PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector. - Guy N. Rothblum; Eran Omri; Junye Chen; Kunal Talwar (USENIX Security Symposium, 2024)

New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs. - Bar Alon; Amos Beimel; Tamar Ben David; Eran Omri; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2024)

MYao: Multiparty "Yao" Garbled Circuits with Row Reduction, Half Gates, and Efficient Online Computation. - Aner Ben-Efraim; Lior Breitman; Jonathan Bronshtein; Olga Nissenbaum; Eran Omri (IACR Cryptol. ePrint Arch., 2024)

Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. - Gilad Asharov; Amos Beimel; Nikolaos Makriyannis; Eran Omri (SIAM J. Comput., 2024)

New Techniques for Analyzing Fully Secure Protocols: A Case Study of Solitary Output Secure Computation. - Bar Alon; Benjamin Saldman; Eran Omri (IACR Cryptol. ePrint Arch., 2025)