J1 M. Kojman, G. Lee, E. Omri, and A. Weiermann. Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers. Journal of Combinatorial Theory, 115(Series A):1036 – 1055, August 2008. J2 E. Omri and A. Weiermann. Classifying the phase transition threshold for Ackermannian functions. Annals of Pure and Applied Logic, 2008. J3 A. Beimel, B. BenMoshe, Y. BenShimol, P. Carmi, E. Chai, I. Kitroser, and E. Omri. Matrix columns allocation problems. Theor. Comput. Sci., 410(2123):2174–2183, 2009. J4 I. Haitner and E. Omri. Coin flipping with constant bias implies oneway functions. SIAM Journal of Computing 43(2): 389–409, 2014 3/7 J5 A. Beimel, E. Omri, and I. Orlov. Protocols for Multiparty Coin Toss with a Dishonest Majority. Journal of Cryptology: Volume 28, Issue 3 (2015), Page 551600. J6 I. Haitner and E. Omri and H. Zarosim. Limits on the Usefulness of Random Oracles. Journal of Cryptology: Volume 29, Issue 2 (2016), Page 283–335. J7 B. BenMoshe, M. Elkin, L. Gottlieb, and E. Omri. Optimizing budget allocation for center and median points. Theor. Comput. Sci. 627: 13–25 (2016). . J8 G. Nivasch and E. Omri. Rainbow Matchings and Algebras of Sets. Graphs and Combinatorics 33(2): 473–484 (2017) J9 R. Cohen and I. Haitner and E. Omri and L. Rotem. Characterization of Secure Multiparty Computation Without Broadcast. J. Cryptology 31(2): 587609 (2018) J10 Y. Lindell, E. Omri, H. Zarosim: Completeness for Symmetric TwoParty Functionalities  Revisited. J. Cryptology 31(3): 671697 (2018) Original Papers Accepted to Refereed Journals JA11 A. Beimel, Yehuda Lindell, E. Omri, and I. Orlov. 1/psecure multiparty computation without honest majority and the best of both worlds. Accepted for publication, Journal of Cryptology, 2019 C1 A. Beimel, K. Nissim, and E. Omri. Distributed private data analysis: Simultaneously solving how and what. In Advances in Cryptology – CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 451–468. SpringerVerlag, 2008. C2 A. Beimel, E. Omri, and I. Orlov. Protocols for multiparty coin toss with dishonest majority. In Advances in Cryptology – CRYPTO 2010, volume 6223 of Lecture Notes in Computer Science, pages 538–557, SpringerVerlag, 2010. C3 I. Haitner and E. Omri. Coin flipping with constant bias implies oneway functions. In Proc. of the 52nd IEEE Symp. on Foundations of Computer Science, pages 110–119, 2011. C4 A. Beimel, Yehuda Lindell, E. Omri, and I. Orlov. 1/psecure multiparty computation without honest majority and the best of both worlds. In Advances in Cryptology – CRYPTO 2011, volume 6841 of Lecture Notes in Computer Science, pages 277296, SpringerVerlag, 2011. C5 B. BenMoshe, M. Elkin, and E. Omri. Optimizing budget allocation problems in graphs. In Proc. of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, August 1012, 2011. C6 Yehuda Lindell, Eran Omri, Hila Zarosim: Completeness for Symmetric TwoParty Functionalities  Revisited. In Advances in Cryptology  ASIACRYPT 2012  18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, December 26, 2012, LNCS Volume 7658, 2012, pages 116133. C7 I. Haitner and E. Omri and H. Zarosim. Limits on the Usefulness of Random Oracles. In Proc. of Theory of Cryptography  10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 36, 2013, LNCS Volume 7785, 2013, pages 437456. C8 G. Asharov and A. Beimel and N. Makriyannis and E. Omri. Complete Characterization of Fairness in Secure TwoParty Computation of Boolean Functions. In Proc. of Theory of Cryptography  12th Theory of Cryptography Conference, TCC 2015, LNCS Volume 9014, 2015, pages 199228. 4/7 C9 I. Haitner and Y. Ishai and E. Omri and R. Shaltiel. Parallel Hashing via List Recoverability. In Advances in Cryptology – CRYPTO 2015, volume 9216 of Lecture Notes in Computer Science, pages 173–190, SpringerVerlag, 2015. C10 G. Nivasch and E. Omri. Rainbow matchings and algebras of sets. In EUROCOMB 2015. C11 R. Cohen and I. Haitner and E. Omri and L. Rotem. Characterization of Secure Multiparty Computation Without Broadcast. Theory of Cryptography – 13th International Conference, TCC 2016A, Tel Aviv, Israel, January 2016, Proceedings, Part I, pages 596–616, 2016. C12 A. Ben Efraim, Y. Lindell, E. Omri. Optimizing SemiHonest Secure Multiparty Computation for the Internet. The 23rd ACM Conference on Computer and Communications Security Hofburg Palace, Vienna, Austria. October 2428, 2016. C13 B. Alon, E. Omri. AlmostOptimally Fair Multiparty CoinTossing with Nearly ThreeQuarters Malicious. Theory of Cryptography – Fourteenth IACR Theory of Cryptography Conference  TCC 2016B, Beijing, China. Oct. 31  Nov. 3, 2016. C14 A. Ben Efraim, E. Omri. Concrete Efficiency Improvements for Multiparty Garbling with an Honest Majority. Latincrypt 2017. C15 A. Ben Efraim, Y. Lindell, E. Omri. Efficient Scalable ConstantRound MPC via Garbled Circuits. ASIACRYPT (2) 2017: 471498. C16 Iftach Haitner, Nikolaos Makriyannis, Eran Omri: On the Complexity of Fair Coin Flipping. TCC (1) 2018: 539562 C17 Roi Inbar, Eran Omri, Benny Pinkas: Efficient Scalable Multiparty Private Set Intersection via Garbled Bloom Filters. SCN 2018: 235252 C18 Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem: From Fairness to Full Security in Multiparty Computation. SCN 2018: 216234 C19 Amos Beimel, Iftach Haitner, Nikolaos Makriyannis, Eran Omri: Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling. FOCS 2018: 838849 C20 Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak: Computational TwoParty Correlation: A Dichotomy for KeyAgreement Protocols. FOCS 2018: 136147 C21 Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. ACNS 2019, LNCS 11464.
