חברי סגל

ערן עמרי

מרצה בכיר

תחומי מחקר

קריפטוגרפיה, חישוב פרטי.

פרסומים

J-1 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.
J-2 E. Omri and A. Weiermann. Classifying the phase transition threshold for Ackermannian
functions. Annals of Pure and Applied Logic, 2008.
J-3 A. Beimel, B. Ben-Moshe, Y. Ben-Shimol, P. Carmi, E. Chai, I. Kitroser, and E. Omri.
Matrix columns allocation problems. Theor. Comput. Sci., 410(21-23):2174–2183,
2009.
J-4 I. Haitner and E. Omri. Coin flipping with constant bias implies one-way functions.
SIAM Journal of Computing 43(2): 389–409, 2014
3/7
J-5 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 551-600.
J-6 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.
J-7 B. Ben-Moshe, M. Elkin, L. Gottlieb, and E. Omri. Optimizing budget allocation for
center and median points. Theor. Comput. Sci. 627: 13–25 (2016).
.
J-8 G. Nivasch and E. Omri. Rainbow Matchings and Algebras of Sets. Graphs and
Combinatorics 33(2): 473–484 (2017)
J-9 R. Cohen and I. Haitner and E. Omri and L. Rotem. Characterization of Secure
Multiparty Computation Without Broadcast. J. Cryptology 31(2): 587-609 (2018)
J-10 Y. Lindell, E. Omri, H. Zarosim: Completeness for Symmetric Two-Party Functionalities
- Revisited. J. Cryptology 31(3): 671-697 (2018)
Original Papers Accepted to Refereed Journals
JA-11 A. Beimel, Yehuda Lindell, E. Omri, and I. Orlov. 1/p-secure multiparty computation
without honest majority and the best of both worlds. Accepted for publication, Journal
of Cryptology, 2019
C-1 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. Springer-Verlag, 2008.
C-2 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, Springer-Verlag, 2010.
C-3 I. Haitner and E. Omri. Coin flipping with constant bias implies one-way functions. In
Proc. of the 52nd IEEE Symp. on Foundations of Computer Science, pages 110–119,
2011.
C-4 A. Beimel, Yehuda Lindell, E. Omri, and I. Orlov. 1/p-secure 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 277-296,
Springer-Verlag, 2011.
C-5 B. Ben-Moshe, 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 10-12, 2011.
C-6 Yehuda Lindell, Eran Omri, Hila Zarosim: Completeness for Symmetric Two-Party
Functionalities - Revisited. In Advances in Cryptology - ASIACRYPT 2012 - 18th
International Conference on the Theory and Application of Cryptology and Information
Security, Beijing, China, December 2-6, 2012, LNCS Volume 7658, 2012, pages 116-133.
C-7 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 3-6, 2013, LNCS Volume 7785, 2013, pages 437-456.
C-8 G. Asharov and A. Beimel and N. Makriyannis and E. Omri. Complete Characterization
of Fairness in Secure Two-Party Computation of Boolean Functions. In Proc. of Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, LNCS Volume
9014, 2015, pages 199-228.
4/7
C-9 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, Springer-Verlag, 2015.
C-10 G. Nivasch and E. Omri. Rainbow matchings and algebras of sets. In EUROCOMB
2015.
C-11 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 2016-A, Tel Aviv, Israel, January 2016, Proceedings, Part I, pages
596–616, 2016.
C-12 A. Ben Efraim, Y. Lindell, E. Omri. Optimizing Semi-Honest Secure Multiparty
Computation for the Internet. The 23rd ACM Conference on Computer and Communications
Security Hofburg Palace, Vienna, Austria. October 24-28, 2016.
C-13 B. Alon, E. Omri. Almost-Optimally Fair Multiparty Coin-Tossing with Nearly
Three-Quarters Malicious. Theory of Cryptography – Fourteenth IACR Theory of
Cryptography Conference - TCC 2016-B, Beijing, China. Oct. 31 - Nov. 3, 2016.
C-14 A. Ben Efraim, E. Omri. Concrete Efficiency Improvements for Multiparty Garbling
with an Honest Majority. Latincrypt 2017.
C-15 A. Ben Efraim, Y. Lindell, E. Omri. Efficient Scalable Constant-Round MPC via
Garbled Circuits. ASIACRYPT (2) 2017: 471-498.
C-16 Iftach Haitner, Nikolaos Makriyannis, Eran Omri: On the Complexity of Fair Coin
Flipping. TCC (1) 2018: 539-562
C-17 Roi Inbar, Eran Omri, Benny Pinkas: Efficient Scalable Multiparty Private Set-
Intersection via Garbled Bloom Filters. SCN 2018: 235-252
C-18 Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem: From Fairness to Full Security in
Multiparty Computation. SCN 2018: 216-234
C-19 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
C-20 Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak: Computational
Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018:
136-147
C-21 Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent
Preprocessing. ACNS 2019, LNCS 11464.
J-1 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.
J-2 E. Omri and A. Weiermann. Classifying the phase transition threshold for Ackermannian
functions. Annals of Pure and Applied Logic, 2008.
J-3 A. Beimel, B. Ben-Moshe, Y. Ben-Shimol, P. Carmi, E. Chai, I. Kitroser, and E. Omri.
Matrix columns allocation problems. Theor. Comput. Sci., 410(21-23):2174–2183,
2009.
J-4 I. Haitner and E. Omri. Coin flipping with constant bias implies one-way functions.
SIAM Journal of Computing 43(2): 389–409, 2014
 
J-5 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 551-600.
J-6 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.
J-7 B. Ben-Moshe, M. Elkin, L. Gottlieb, and E. Omri. Optimizing budget allocation for
center and median points. Theor. Comput. Sci. 627: 13–25 (2016).
.
J-8 G. Nivasch and E. Omri. Rainbow Matchings and Algebras of Sets. Graphs and
Combinatorics 33(2): 473–484 (2017)
J-9 R. Cohen and I. Haitner and E. Omri and L. Rotem. Characterization of Secure
Multiparty Computation Without Broadcast. J. Cryptology 31(2): 587-609 (2018)
J-10 Y. Lindell, E. Omri, H. Zarosim: Completeness for Symmetric Two-Party Functionalities
- Revisited. J. Cryptology 31(3): 671-697 (2018)
Original Papers Accepted to Refereed Journals
JA-11 A. Beimel, Yehuda Lindell, E. Omri, and I. Orlov. 1/p-secure multiparty computation
without honest majority and the best of both worlds. Accepted for publication, Journal
of Cryptology, 2019
C-1 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. Springer-Verlag, 2008.
C-2 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, Springer-Verlag, 2010.
C-3 I. Haitner and E. Omri. Coin flipping with constant bias implies one-way functions. In
Proc. of the 52nd IEEE Symp. on Foundations of Computer Science, pages 110–119,
2011.
C-4 A. Beimel, Yehuda Lindell, E. Omri, and I. Orlov. 1/p-secure 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 277-296,
Springer-Verlag, 2011.
C-5 B. Ben-Moshe, 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 10-12, 2011.
C-6 Yehuda Lindell, Eran Omri, Hila Zarosim: Completeness for Symmetric Two-Party
Functionalities - Revisited. In Advances in Cryptology - ASIACRYPT 2012 - 18th
International Conference on the Theory and Application of Cryptology and Information
Security, Beijing, China, December 2-6, 2012, LNCS Volume 7658, 2012, pages 116-133.
C-7 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 3-6, 2013, LNCS Volume 7785, 2013, pages 437-456.
C-8 G. Asharov and A. Beimel and N. Makriyannis and E. Omri. Complete Characterization
of Fairness in Secure Two-Party Computation of Boolean Functions. In Proc. of Theory
of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, LNCS Volume
9014, 2015, pages 199-228.
 
C-9 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, Springer-Verlag, 2015.
C-10 G. Nivasch and E. Omri. Rainbow matchings and algebras of sets. In EUROCOMB
2015.
C-11 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 2016-A, Tel Aviv, Israel, January 2016, Proceedings, Part I, pages
596–616, 2016.
C-12 A. Ben Efraim, Y. Lindell, E. Omri. Optimizing Semi-Honest Secure Multiparty
Computation for the Internet. The 23rd ACM Conference on Computer and Communications
Security Hofburg Palace, Vienna, Austria. October 24-28, 2016.
C-13 B. Alon, E. Omri. Almost-Optimally Fair Multiparty Coin-Tossing with Nearly
Three-Quarters Malicious. Theory of Cryptography – Fourteenth IACR Theory of
Cryptography Conference - TCC 2016-B, Beijing, China. Oct. 31 - Nov. 3, 2016.
C-14 A. Ben Efraim, E. Omri. Concrete Efficiency Improvements for Multiparty Garbling
with an Honest Majority. Latincrypt 2017.
C-15 A. Ben Efraim, Y. Lindell, E. Omri. Efficient Scalable Constant-Round MPC via
Garbled Circuits. ASIACRYPT (2) 2017: 471-498.
C-16 Iftach Haitner, Nikolaos Makriyannis, Eran Omri: On the Complexity of Fair Coin
Flipping. TCC (1) 2018: 539-562
C-17 Roi Inbar, Eran Omri, Benny Pinkas: Efficient Scalable Multiparty Private Set-
Intersection via Garbled Bloom Filters. SCN 2018: 235-252
C-18 Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem: From Fairness to Full Security in
Multiparty Computation. SCN 2018: 216-234
C-19 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
C-20 Iftach Haitner, Kobbi Nissim, Eran Omri, Ronen Shaltiel, Jad Silbak: Computational
Two-Party Correlation: A Dichotomy for Key-Agreement Protocols. FOCS 2018:
136-147
C-21 Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent
Preprocessing. ACNS 2019, LNCS 11464.
עריכת פרופילעריכת פרופיל